Base | Representation |
---|---|
bin | 100110111011110110100… |
… | …0000100100001100110101 |
3 | 200221120102001212210122222 |
4 | 1031313231000210030311 |
5 | 1200133234410210424 |
6 | 15214151235132125 |
7 | 1061416662606545 |
oct | 115675500441465 |
9 | 20846361783588 |
10 | 5351210631989 |
11 | 1783487994612 |
12 | 725125744045 |
13 | 2ca80370a481 |
14 | 146dddd15325 |
15 | 942e5bb0e5e |
hex | 4dded024335 |
5351210631989 has 2 divisors, whose sum is σ = 5351210631990. Its totient is φ = 5351210631988.
The previous prime is 5351210631947. The next prime is 5351210632003. The reversal of 5351210631989 is 9891360121535.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4990568345764 + 360642286225 = 2233958^2 + 600535^2 .
It is a cyclic number.
It is not a de Polignac number, because 5351210631989 - 216 = 5351210566453 is a prime.
It is a super-2 number, since 2×53512106319892 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5351210631989.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5351210634989) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2675605315994 + 2675605315995.
It is an arithmetic number, because the mean of its divisors is an integer number (2675605315995).
Almost surely, 25351210631989 is an apocalyptic number.
It is an amenable number.
5351210631989 is a deficient number, since it is larger than the sum of its proper divisors (1).
5351210631989 is an equidigital number, since it uses as much as digits as its factorization.
5351210631989 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1749600, while the sum is 53.
The spelling of 5351210631989 in words is "five trillion, three hundred fifty-one billion, two hundred ten million, six hundred thirty-one thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •