Base | Representation |
---|---|
bin | 10111001111100000011000… |
… | …11111101100001001111001 |
3 | 20200222002200002222112102022 |
4 | 23213300030133230021321 |
5 | 23144342414014100223 |
6 | 300411431310044225 |
7 | 13523412246526436 |
oct | 1347601437541171 |
9 | 220862602875368 |
10 | 51110320456313 |
11 | 153158464aa718 |
12 | 5895632aa9675 |
13 | 22698b46c9521 |
14 | c89a77610b8d |
15 | 5d976b6bdac8 |
hex | 2e7c0c7ec279 |
51110320456313 has 2 divisors, whose sum is σ = 51110320456314. Its totient is φ = 51110320456312.
The previous prime is 51110320456271. The next prime is 51110320456361. The reversal of 51110320456313 is 31365402301115.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 49232072134249 + 1878248322064 = 7016557^2 + 1370492^2 .
It is a cyclic number.
It is not a de Polignac number, because 51110320456313 - 216 = 51110320390777 is a prime.
It is a super-2 number, since 2×511103204563132 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (51110320356313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25555160228156 + 25555160228157.
It is an arithmetic number, because the mean of its divisors is an integer number (25555160228157).
Almost surely, 251110320456313 is an apocalyptic number.
It is an amenable number.
51110320456313 is a deficient number, since it is larger than the sum of its proper divisors (1).
51110320456313 is an equidigital number, since it uses as much as digits as its factorization.
51110320456313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32400, while the sum is 35.
Adding to 51110320456313 its reverse (31365402301115), we get a palindrome (82475722757428).
The spelling of 51110320456313 in words is "fifty-one trillion, one hundred ten billion, three hundred twenty million, four hundred fifty-six thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •