Base | Representation |
---|---|
bin | 11101110110010000100… |
… | …100111011110000100010 |
3 | 21021002022102120000011220 |
4 | 131312100210323300202 |
5 | 232101201000020000 |
6 | 4210135051115510 |
7 | 301121534562603 |
oct | 35662044736042 |
9 | 7232272500156 |
10 | 2051125001250 |
11 | 720971654a36 |
12 | 291631742b96 |
13 | 11b5603c96c0 |
14 | 713bc789daa |
15 | 3854b4e61a0 |
hex | 1dd9093bc22 |
2051125001250 has 160 divisors (see below), whose sum is σ = 5529787401600. Its totient is φ = 504042240000.
The previous prime is 2051125001249. The next prime is 2051125001287. The reversal of 2051125001250 is 521005211502.
It is a super-2 number, since 2×20511250012502 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2051125001250.
It is an unprimeable number.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 29166130 + ... + 29236370.
It is an arithmetic number, because the mean of its divisors is an integer number (34561171260).
Almost surely, 22051125001250 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2051125001250, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2764893700800).
2051125001250 is an abundant number, since it is smaller than the sum of its proper divisors (3478662400350).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2051125001250 is a wasteful number, since it uses less digits than its factorization.
2051125001250 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 70878 (or 70863 counting only the distinct ones).
The product of its (nonzero) digits is 1000, while the sum is 24.
The spelling of 2051125001250 in words is "two trillion, fifty-one billion, one hundred twenty-five million, one thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •