Base | Representation |
---|---|
bin | 10011111100011110… |
… | …01010110000000000 |
3 | 1000122020200122001200 |
4 | 21332033022300000 |
5 | 133412201340000 |
6 | 4530310101200 |
7 | 526231065264 |
oct | 117617126000 |
9 | 30566618050 |
10 | 10707840000 |
11 | 45a5329750 |
12 | 20aa04a800 |
13 | 1018543200 |
14 | 73817c0a4 |
15 | 42a0cd500 |
hex | 27e3cac00 |
10707840000 has 990 divisors, whose sum is σ = 45639887436. Its totient is φ = 2396160000.
The previous prime is 10707839999. The next prime is 10707840007. The reversal of 10707840000 is 4870701.
It is a tau number, because it is divible by the number of its divisors (990).
It is a super-3 number, since 3×107078400003 (a number of 31 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (10707840007) by changing a digit.
It is a polite number, since it can be written in 89 ways as a sum of consecutive naturals, for example, 823679994 + ... + 823680006.
Almost surely, 210707840000 is an apocalyptic number.
10707840000 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 10707840000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22819943718).
10707840000 is an abundant number, since it is smaller than the sum of its proper divisors (34932047436).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10707840000 is a wasteful number, since it uses less digits than its factorization.
10707840000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83 (or 34 counting only the distinct ones).
The product of its (nonzero) digits is 1568, while the sum is 27.
The spelling of 10707840000 in words is "ten billion, seven hundred seven million, eight hundred forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •