Base | Representation |
---|---|
bin | 100100011000110001100… |
… | …1100001001001001000100 |
3 | 122201002110201012021102101 |
4 | 1020301203030021021010 |
5 | 1123414030022410400 |
6 | 14345232551521444 |
7 | 1024211410063021 |
oct | 110614314111104 |
9 | 18632421167371 |
10 | 5001006060100 |
11 | 1658a075aa396 |
12 | 68928a989284 |
13 | 2a37926438bb |
14 | 13409b230548 |
15 | 8a14abed56a |
hex | 48c63309244 |
5001006060100 has 18 divisors (see below), whose sum is σ = 10852183150634. Its totient is φ = 2000402424000.
The previous prime is 5001006060077. The next prime is 5001006060109. The reversal of 5001006060100 is 10606001005.
It can be written as a sum of positive squares in 3 ways, for example, as 13716625924 + 4987289434176 = 117118^2 + 2233224^2 .
It is a super-2 number, since 2×50010060601002 (a number of 26 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (5001006060109) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 25005030201 + ... + 25005030400.
Almost surely, 25001006060100 is an apocalyptic number.
5001006060100 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
5001006060100 is an abundant number, since it is smaller than the sum of its proper divisors (5851177090534).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5001006060100 is a wasteful number, since it uses less digits than its factorization.
5001006060100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50010060615 (or 50010060608 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 19.
The spelling of 5001006060100 in words is "five trillion, one billion, six million, sixty thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •