Base | Representation |
---|---|
bin | 101111100110000100… |
… | …001100111000000010 |
3 | 11212220120010122111120 |
4 | 233212010030320002 |
5 | 1314130223020000 |
6 | 35251014453110 |
7 | 3456263044005 |
oct | 574604147002 |
9 | 155816118446 |
10 | 51104501250 |
11 | 1a745182200 |
12 | 9aa2964196 |
13 | 4a8583846a |
14 | 268b2c153c |
15 | 14e18196a0 |
hex | be610ce02 |
51104501250 has 360 divisors, whose sum is σ = 146042114064. Its totient is φ = 11906400000.
The previous prime is 51104501237. The next prime is 51104501299. The reversal of 51104501250 is 5210540115.
It is a super-2 number, since 2×511045012502 (a number of 22 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 51104501250.
It is an unprimeable number.
It is a polite number, since it can be written in 179 ways as a sum of consecutive naturals, for example, 762753717 + ... + 762753783.
Almost surely, 251104501250 is an apocalyptic number.
51104501250 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 51104501250, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (73021057032).
51104501250 is an abundant number, since it is smaller than the sum of its proper divisors (94937612814).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51104501250 is a wasteful number, since it uses less digits than its factorization.
51104501250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 196 (or 129 counting only the distinct ones).
The product of its (nonzero) digits is 1000, while the sum is 24.
The spelling of 51104501250 in words is "fifty-one billion, one hundred four million, five hundred one thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •