Base | Representation |
---|---|
bin | 10111001111011001001000… |
… | …00001110111011100111001 |
3 | 20200221201121022012021220001 |
4 | 23213230210001313130321 |
5 | 23144311422100333103 |
6 | 300405544304433001 |
7 | 13523213511124645 |
oct | 1347544401673471 |
9 | 220851538167801 |
10 | 51106420324153 |
11 | 15314124a276a7 |
12 | 5894924918761 |
13 | 22694126a340c |
14 | c897c7655c25 |
15 | 5d95de0c401d |
hex | 2e7b24077739 |
51106420324153 has 2 divisors, whose sum is σ = 51106420324154. Its totient is φ = 51106420324152.
The previous prime is 51106420324051. The next prime is 51106420324163. The reversal of 51106420324153 is 35142302460115.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 32265160539049 + 18841259785104 = 5680243^2 + 4340652^2 .
It is a cyclic number.
It is not a de Polignac number, because 51106420324153 - 221 = 51106418227001 is a prime.
It is a super-2 number, since 2×511064203241532 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (51106420324163) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25553210162076 + 25553210162077.
It is an arithmetic number, because the mean of its divisors is an integer number (25553210162077).
Almost surely, 251106420324153 is an apocalyptic number.
It is an amenable number.
51106420324153 is a deficient number, since it is larger than the sum of its proper divisors (1).
51106420324153 is an equidigital number, since it uses as much as digits as its factorization.
51106420324153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 86400, while the sum is 37.
Adding to 51106420324153 its reverse (35142302460115), we get a palindrome (86248722784268).
The spelling of 51106420324153 in words is "fifty-one trillion, one hundred six billion, four hundred twenty million, three hundred twenty-four thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •