Base | Representation |
---|---|
bin | 10100010100010010… |
… | …00111110000000000 |
3 | 1001011011112112210210 |
4 | 22022021013300000 |
5 | 134314320101230 |
6 | 5002203154120 |
7 | 534204624660 |
oct | 121211076000 |
9 | 31134475723 |
10 | 10907581440 |
11 | 4698055418 |
12 | 2144b15940 |
13 | 104aa39902 |
14 | 7568d41a0 |
15 | 43c8d5eb0 |
hex | 28a247c00 |
10907581440 has 352 divisors, whose sum is σ = 40135610880. Its totient is φ = 2476670976.
The previous prime is 10907581423. The next prime is 10907581457. The reversal of 10907581440 is 4418570901.
It is an interprime number because it is at equal distance from previous prime (10907581423) and next prime (10907581457).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 24621859 + ... + 24622301.
Almost surely, 210907581440 is an apocalyptic number.
10907581440 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 10907581440, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (20067805440).
10907581440 is an abundant number, since it is smaller than the sum of its proper divisors (29228029440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10907581440 is a wasteful number, since it uses less digits than its factorization.
10907581440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 707 (or 689 counting only the distinct ones).
The product of its (nonzero) digits is 40320, while the sum is 39.
The spelling of 10907581440 in words is "ten billion, nine hundred seven million, five hundred eighty-one thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •