Base | Representation |
---|---|
bin | 10010110100111100… |
… | …10110100111000000 |
3 | 222002102200112010000 |
4 | 21122132112213000 |
5 | 131200101402320 |
6 | 4350554040000 |
7 | 505324142040 |
oct | 113236264700 |
9 | 28072615100 |
10 | 10107840960 |
11 | 4317681578 |
12 | 1b61119000 |
13 | c51147ba9 |
14 | 6bc5d5720 |
15 | 3e25b0c90 |
hex | 25a7969c0 |
10107840960 has 1120 divisors, whose sum is σ = 45407640960. Its totient is φ = 2080899072.
The previous prime is 10107840949. The next prime is 10107841019. The reversal of 10107840960 is 6904870101.
It is a tau number, because it is divible by the number of its divisors (1120).
It is a super-3 number, since 3×101078409603 (a number of 31 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 159 ways as a sum of consecutive naturals, for example, 89449864 + ... + 89449976.
Almost surely, 210107840960 is an apocalyptic number.
10107840960 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 10107840960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22703820480).
10107840960 is an abundant number, since it is smaller than the sum of its proper divisors (35299800000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10107840960 is a wasteful number, since it uses less digits than its factorization.
10107840960 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 195 (or 176 counting only the distinct ones).
The product of its (nonzero) digits is 12096, while the sum is 36.
The spelling of 10107840960 in words is "ten billion, one hundred seven million, eight hundred forty thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •