Base | Representation |
---|---|
bin | 10111001110000111000100… |
… | …00001110000010000100001 |
3 | 20200210111212220011212110012 |
4 | 23213003202001300100201 |
5 | 23143101210002403343 |
6 | 300333420442214305 |
7 | 13520063651613443 |
oct | 1347034201602041 |
9 | 220714786155405 |
10 | 51062363325473 |
11 | 152a74769a4495 |
12 | 588828a1b4395 |
13 | 2265210c63626 |
14 | c87608338493 |
15 | 5d83b1358718 |
hex | 2e70e2070421 |
51062363325473 has 2 divisors, whose sum is σ = 51062363325474. Its totient is φ = 51062363325472.
The previous prime is 51062363325367. The next prime is 51062363325481. The reversal of 51062363325473 is 37452336326015.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 34392266418064 + 16670096907409 = 5864492^2 + 4082903^2 .
It is a cyclic number.
It is not a de Polignac number, because 51062363325473 - 210 = 51062363324449 is a prime.
It is a super-2 number, since 2×510623633254732 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (51062363327473) 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, 25531181662736 + 25531181662737.
It is an arithmetic number, because the mean of its divisors is an integer number (25531181662737).
Almost surely, 251062363325473 is an apocalyptic number.
It is an amenable number.
51062363325473 is a deficient number, since it is larger than the sum of its proper divisors (1).
51062363325473 is an equidigital number, since it uses as much as digits as its factorization.
51062363325473 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8164800, while the sum is 50.
The spelling of 51062363325473 in words is "fifty-one trillion, sixty-two billion, three hundred sixty-three million, three hundred twenty-five thousand, four hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •