Base | Representation |
---|---|
bin | 10111001111100000000111… |
… | …00010001011000011010011 |
3 | 20200222002021122002021002020 |
4 | 23213300003202023003103 |
5 | 23144342112022042321 |
6 | 300411404335422523 |
7 | 13523405442604440 |
oct | 1347600342130323 |
9 | 220862248067066 |
10 | 51110170112211 |
11 | 153157796529a1 |
12 | 58955b0684a43 |
13 | 226988c509b12 |
14 | c89a616769c7 |
15 | 5d975d3c24c6 |
hex | 2e7c0388b0d3 |
51110170112211 has 32 divisors (see below), whose sum is σ = 78159911731200. Its totient is φ = 29101662815904.
The previous prime is 51110170112201. The next prime is 51110170112219. The reversal of 51110170112211 is 11221107101115.
It is not a de Polignac number, because 51110170112211 - 26 = 51110170112147 is a prime.
It is a super-2 number, since 2×511101701122112 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (51110170112219) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 208470846 + ... + 208715868.
It is an arithmetic number, because the mean of its divisors is an integer number (2442497241600).
Almost surely, 251110170112211 is an apocalyptic number.
51110170112211 is a deficient number, since it is larger than the sum of its proper divisors (27049741618989).
51110170112211 is a wasteful number, since it uses less digits than its factorization.
51110170112211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 280415.
The product of its (nonzero) digits is 140, while the sum is 24.
Adding to 51110170112211 its reverse (11221107101115), we get a palindrome (62331277213326).
It can be divided in two parts, 51110170 and 112211, that added together give a triangular number (51222381 = T10121).
The spelling of 51110170112211 in words is "fifty-one trillion, one hundred ten billion, one hundred seventy million, one hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •