Base | Representation |
---|---|
bin | 101111100101110110… |
… | …110110010101010111 |
3 | 11212220022112211010102 |
4 | 233211312312111113 |
5 | 1314123324013142 |
6 | 35250411444315 |
7 | 3456221225225 |
oct | 574566662527 |
9 | 155808484112 |
10 | 51101001047 |
11 | 1a743201478 |
12 | 9aa175669b |
13 | 4a84bb1235 |
14 | 268aa4db15 |
15 | 14e1377532 |
hex | be5db6557 |
51101001047 has 2 divisors, whose sum is σ = 51101001048. Its totient is φ = 51101001046.
The previous prime is 51101001037. The next prime is 51101001167. The reversal of 51101001047 is 74010010115.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 51101001047 - 226 = 51033892183 is a prime.
It is a super-2 number, since 2×511010010472 (a number of 22 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51101001037) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25550500523 + 25550500524.
It is an arithmetic number, because the mean of its divisors is an integer number (25550500524).
Almost surely, 251101001047 is an apocalyptic number.
51101001047 is a deficient number, since it is larger than the sum of its proper divisors (1).
51101001047 is an equidigital number, since it uses as much as digits as its factorization.
51101001047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 140, while the sum is 20.
The spelling of 51101001047 in words is "fifty-one billion, one hundred one million, one thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •