Base | Representation |
---|---|
bin | 101111101001001100… |
… | …101101100111000010 |
3 | 11220001020001010012220 |
4 | 233221030231213002 |
5 | 1314232202023010 |
6 | 35300133231510 |
7 | 3460501604364 |
oct | 575114554702 |
9 | 156036033186 |
10 | 51157064130 |
11 | 1a7719134a7 |
12 | 9ab8492596 |
13 | 4a936b0263 |
14 | 2694284d34 |
15 | 14e624d970 |
hex | be932d9c2 |
51157064130 has 32 divisors (see below), whose sum is σ = 124506211968. Its totient is φ = 13449744000.
The previous prime is 51157064081. The next prime is 51157064137. The reversal of 51157064130 is 3146075115.
It is a junction number, because it is equal to n+sod(n) for n = 51157064091 and 51157064100.
It is not an unprimeable number, because it can be changed into a prime (51157064137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12006571 + ... + 12010830.
It is an arithmetic number, because the mean of its divisors is an integer number (3890819124).
Almost surely, 251157064130 is an apocalyptic number.
51157064130 is an abundant number, since it is smaller than the sum of its proper divisors (73349147838).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51157064130 is a wasteful number, since it uses less digits than its factorization.
51157064130 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24017482.
The product of its (nonzero) digits is 12600, while the sum is 33.
The spelling of 51157064130 in words is "fifty-one billion, one hundred fifty-seven million, sixty-four thousand, one hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.221 sec. • engine limits •