Base | Representation |
---|---|
bin | 110000011001101101… |
… | …101100000100100111 |
3 | 11222010221122002211121 |
4 | 300121231230010213 |
5 | 1322414034434301 |
6 | 35513011114411 |
7 | 3516614224012 |
oct | 603155540447 |
9 | 158127562747 |
10 | 51971014951 |
11 | 2004a312829 |
12 | a0a4ba2a07 |
13 | 4b9320906b |
14 | 2730402379 |
15 | 154292e3a1 |
hex | c19b6c127 |
51971014951 has 2 divisors, whose sum is σ = 51971014952. Its totient is φ = 51971014950.
The previous prime is 51971014939. The next prime is 51971015071. The reversal of 51971014951 is 15941017915.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 51971014951 - 25 = 51971014919 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 51971014898 and 51971014907.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51971014351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25985507475 + 25985507476.
It is an arithmetic number, because the mean of its divisors is an integer number (25985507476).
Almost surely, 251971014951 is an apocalyptic number.
51971014951 is a deficient number, since it is larger than the sum of its proper divisors (1).
51971014951 is an equidigital number, since it uses as much as digits as its factorization.
51971014951 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 56700, while the sum is 43.
The spelling of 51971014951 in words is "fifty-one billion, nine hundred seventy-one million, fourteen thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •