# 1531440 (number)

1,531,440 (one million five hundred thirty-one thousand four hundred forty) is an even seven-digits composite number following 1531439 and preceding 1531441. In scientific notation, it is written as 1.53144 × 106. The sum of its digits is 18. It has a total of 9 prime factors and 80 positive divisors. There are 407,808 positive integers (up to 1531440) that are relatively prime to 1531440.

## Basic properties

• Is Prime? No
• Number parity Even
• Number length 7
• Sum of Digits 18
• Digital Root 9

## Name

Short name 1 million 531 thousand 440 one million five hundred thirty-one thousand four hundred forty

## Notation

Scientific notation 1.53144 × 106 1.53144 × 106

## Prime Factorization of 1531440

Prime Factorization 24 × 33 × 5 × 709

Composite number
Distinct Factors Total Factors Radical ω(n) 4 Total number of distinct prime factors Ω(n) 9 Total number of prime factors rad(n) 21270 Product of the distinct prime numbers λ(n) -1 Returns the parity of Ω(n), such that λ(n) = (-1)Ω(n) μ(n) 0 Returns: 1, if n has an even number of prime factors (and is square free) −1, if n has an odd number of prime factors (and is square free) 0, if n has a squared prime factor Λ(n) 0 Returns log(p) if n is a power pk of any prime p (for any k >= 1), else returns 0

The prime factorization of 1,531,440 is 24 × 33 × 5 × 709. Since it has a total of 9 prime factors, 1,531,440 is a composite number.

## Divisors of 1531440

80 divisors

 Even divisors 64 16 8 8
Total Divisors Sum of Divisors Aliquot Sum τ(n) 80 Total number of the positive divisors of n σ(n) 5.2824e+06 Sum of all the positive divisors of n s(n) 3.75096e+06 Sum of the proper positive divisors of n A(n) 66030 Returns the sum of divisors (σ(n)) divided by the total number of divisors (τ(n)) G(n) 1237.51 Returns the nth root of the product of n divisors H(n) 23.1931 Returns the total number of divisors (τ(n)) divided by the sum of the reciprocal of each divisors

The number 1,531,440 can be divided by 80 positive divisors (out of which 64 are even, and 16 are odd). The sum of these divisors (counting 1,531,440) is 5,282,400, the average is 66,030.

## Other Arithmetic Functions (n = 1531440)

1 φ(n) n
Euler Totient Carmichael Lambda Prime Pi φ(n) 407808 Total number of positive integers not greater than n that are coprime to n λ(n) 4248 Smallest positive number such that aλ(n) ≡ 1 (mod n) for all a coprime to n π(n) ≈ 116096 Total number of primes less than or equal to n r2(n) 0 The number of ways n can be represented as the sum of 2 squares

There are 407,808 positive integers (less than 1,531,440) that are coprime with 1,531,440. And there are approximately 116,096 prime numbers less than or equal to 1,531,440.

## Divisibility of 1531440

 m n mod m 2 3 4 5 6 7 8 9 0 0 0 0 0 1 0 0

The number 1,531,440 is divisible by 2, 3, 4, 5, 6, 8 and 9.

• Arithmetic
• Refactorable
• Abundant

• Polite
• Practical

• Frugal

## Base conversion (1531440)

Base System Value
2 Binary 101110101111000110000
3 Ternary 2212210202000
4 Quaternary 11311320300
5 Quinary 343001230
6 Senary 52454000
8 Octal 5657060
10 Decimal 1531440
12 Duodecimal 61a300
20 Vigesimal 9b8c0
36 Base36 wto0

## Basic calculations (n = 1531440)

### Multiplication

n×y
 n×2 3062880 4594320 6125760 7657200

### Division

n÷y
 n÷2 765720 510480 382860 306288

### Exponentiation

ny
 n2 2345308473600 3591699208809984000 5500471836339961896960000 8423642589044471247480422400000

### Nth Root

y√n
 2√n 1237.51 115.266 35.1783 17.2592

## 1531440 as geometric shapes

### Circle

 Diameter 3.06288e+06 9.62232e+06 7.368e+12

### Sphere

 Volume 1.50449e+19 2.9472e+13 9.62232e+06

### Square

Length = n
 Perimeter 6.12576e+06 2.34531e+12 2.16578e+06

### Cube

Length = n
 Surface area 1.40719e+13 3.5917e+18 2.65253e+06

### Equilateral Triangle

Length = n
 Perimeter 4.59432e+06 1.01555e+12 1.32627e+06

### Triangular Pyramid

Length = n
 Surface area 4.06219e+12 4.23286e+17 1.25042e+06
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "url": "https://metanumbers.com/1531440", "fetch_time": 1643229439000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2022-05/segments/1642320304961.89/warc/CC-MAIN-20220126192506-20220126222506-00551.warc.gz", "warc_record_offset": 443321164, "warc_record_length": 7722, "token_count": 1372, "char_count": 3979, "score": 3.53125, "int_score": 4, "crawl": "CC-MAIN-2022-05", "snapshot_type": "latest", "language": "en", "language_score": 0.8132908344268799, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00010-of-00064.parquet"}