Base | Representation |
---|---|
bin | 111101111111110… |
… | …111001100011100 |
3 | 2200111020011101010 |
4 | 331333313030130 |
5 | 4112234320244 |
6 | 251114015220 |
7 | 34530066102 |
oct | 7577671434 |
9 | 2614204333 |
10 | 1040151324 |
11 | 4941580a3 |
12 | 250417510 |
13 | 137657874 |
14 | 9c1ddc72 |
15 | 614b2eb9 |
hex | 3dff731c |
1040151324 has 48 divisors (see below), whose sum is σ = 2579689728. Its totient is φ = 325064448.
The previous prime is 1040151319. The next prime is 1040151331. The reversal of 1040151324 is 4231510401.
It is a self number, because there is not a number n which added to its sum of digits gives 1040151324.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 43959 + ... + 63345.
It is an arithmetic number, because the mean of its divisors is an integer number (53743536).
Almost surely, 21040151324 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1040151324, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1289844864).
1040151324 is an abundant number, since it is smaller than the sum of its proper divisors (1539538404).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1040151324 is a wasteful number, since it uses less digits than its factorization.
1040151324 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19674 (or 19672 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 21.
The square root of 1040151324 is about 32251.3770868780. The cubic root of 1040151324 is about 1013.2085409670.
Adding to 1040151324 its reverse (4231510401), we get a palindrome (5271661725).
The spelling of 1040151324 in words is "one billion, forty million, one hundred fifty-one thousand, three hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •