Base | Representation |
---|---|
bin | 10111001111100000000011… |
… | …11011111011100101000011 |
3 | 20200222002012202122120120012 |
4 | 23213300001323323211003 |
5 | 23144342033141411042 |
6 | 300411401541135135 |
7 | 13523404666025345 |
oct | 1347600173734503 |
9 | 220862182576505 |
10 | 51110143310147 |
11 | 15315765507129 |
12 | 58955a36ba4ab |
13 | 2269886ab45cc |
14 | c89a5bc9b295 |
15 | 5d975ad7ae82 |
hex | 2e7c01efb943 |
51110143310147 has 2 divisors, whose sum is σ = 51110143310148. Its totient is φ = 51110143310146.
The previous prime is 51110143310129. The next prime is 51110143310159. The reversal of 51110143310147 is 74101334101115.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 51110143310147 - 28 = 51110143309891 is a prime.
It is a super-2 number, since 2×511101433101472 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (51110143310167) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25555071655073 + 25555071655074.
It is an arithmetic number, because the mean of its divisors is an integer number (25555071655074).
Almost surely, 251110143310147 is an apocalyptic number.
51110143310147 is a deficient number, since it is larger than the sum of its proper divisors (1).
51110143310147 is an equidigital number, since it uses as much as digits as its factorization.
51110143310147 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5040, while the sum is 32.
The spelling of 51110143310147 in words is "fifty-one trillion, one hundred ten billion, one hundred forty-three million, three hundred ten thousand, one hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •