Base | Representation |
---|---|
bin | 11101001011011001010… |
… | …001011111111010111000 |
3 | 21002200111212101211212002 |
4 | 131023121101133322320 |
5 | 230322421100044000 |
6 | 4133044043440132 |
7 | 264602150546333 |
oct | 35133121377270 |
9 | 7080455354762 |
10 | 2005100003000 |
11 | 7033a37515a6 |
12 | 284727b26048 |
13 | 117107037c23 |
14 | 6d093d4361a |
15 | 37255ad98d5 |
hex | 1d2d945feb8 |
2005100003000 has 512 divisors, whose sum is σ = 5279219712000. Its totient is φ = 708922368000.
The previous prime is 2005100002991. The next prime is 2005100003059. The reversal of 2005100003000 is 3000015002.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 7398892865 + ... + 7398893135.
It is an arithmetic number, because the mean of its divisors is an integer number (10310976000).
Almost surely, 22005100003000 is an apocalyptic number.
2005100003000 is a gapful number since it is divisible by the number (20) 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 2005100003000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2639609856000).
2005100003000 is an abundant number, since it is smaller than the sum of its proper divisors (3274119709000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2005100003000 is a wasteful number, since it uses less digits than its factorization.
2005100003000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 608 (or 594 counting only the distinct ones).
The product of its (nonzero) digits is 30, while the sum is 11.
Adding to 2005100003000 its reverse (3000015002), we get a palindrome (2008100018002).
The spelling of 2005100003000 in words is "two trillion, five billion, one hundred million, three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •