Base | Representation |
---|---|
bin | 101111101000110111… |
… | …100000010001100111 |
3 | 11220000211120122211012 |
4 | 233220313200101213 |
5 | 1314224241120422 |
6 | 35255414132435 |
7 | 3460403420456 |
oct | 575067402147 |
9 | 156024518735 |
10 | 51151504487 |
11 | 1a769766456 |
12 | 9ab665111b |
13 | 4a924b4825 |
14 | 2693638b9d |
15 | 14e5a014e2 |
hex | be8de0467 |
51151504487 has 2 divisors, whose sum is σ = 51151504488. Its totient is φ = 51151504486.
The previous prime is 51151504483. The next prime is 51151504543. The reversal of 51151504487 is 78440515115.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 51151504487 - 22 = 51151504483 is a prime.
It is a super-2 number, since 2×511515044872 (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 (51151504483) 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 as a sum of consecutive naturals, namely, 25575752243 + 25575752244.
It is an arithmetic number, because the mean of its divisors is an integer number (25575752244).
Almost surely, 251151504487 is an apocalyptic number.
51151504487 is a deficient number, since it is larger than the sum of its proper divisors (1).
51151504487 is an equidigital number, since it uses as much as digits as its factorization.
51151504487 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 112000, while the sum is 41.
The spelling of 51151504487 in words is "fifty-one billion, one hundred fifty-one million, five hundred four thousand, four hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •