Base | Representation |
---|---|
bin | 110000010100111010… |
… | …010000001011100100 |
3 | 11221221022222120210000 |
4 | 300110322100023210 |
5 | 1322232422010000 |
6 | 35501011501300 |
7 | 3514615212420 |
oct | 602472201344 |
9 | 157838876700 |
10 | 51890422500 |
11 | 200088774a4 |
12 | a081bb7830 |
13 | 4b7c5cc117 |
14 | 2723823b80 |
15 | 153a810000 |
hex | c14e902e4 |
51890422500 has 300 divisors, whose sum is σ = 193731586048. Its totient is φ = 11860344000.
The previous prime is 51890422483. The next prime is 51890422513. The reversal of 51890422500 is 522409815.
51890422500 is a `hidden beast` number, since 5 + 189 + 0 + 422 + 50 + 0 = 666.
It is a tau number, because it is divible by the number of its divisors (300).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 99 ways as a sum of consecutive naturals, for example, 1399197 + ... + 1435803.
Almost surely, 251890422500 is an apocalyptic number.
51890422500 is a gapful number since it is divisible by the number (50) 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 51890422500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (96865793024).
51890422500 is an abundant number, since it is smaller than the sum of its proper divisors (141841163548).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51890422500 is a wasteful number, since it uses less digits than its factorization.
51890422500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 36650 (or 36624 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 36.
The spelling of 51890422500 in words is "fifty-one billion, eight hundred ninety million, four hundred twenty-two thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •