Base | Representation |
---|---|
bin | 10111001111100000000010… |
… | …11101000000111100001001 |
3 | 20200222002012012101211021022 |
4 | 23213300001131000330021 |
5 | 23144342024103040031 |
6 | 300411401051322225 |
7 | 13523404540112141 |
oct | 1347600135007411 |
9 | 220862165354238 |
10 | 51110135205641 |
11 | 15315760981096 |
12 | 58955a0a50375 |
13 | 2269885207745 |
14 | c89a5ab8b921 |
15 | 5d975a2c997b |
hex | 2e7c01740f09 |
51110135205641 has 2 divisors, whose sum is σ = 51110135205642. Its totient is φ = 51110135205640.
The previous prime is 51110135205617. The next prime is 51110135205659. The reversal of 51110135205641 is 14650253101115.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 30296657977600 + 20813477228041 = 5504240^2 + 4562179^2 .
It is a cyclic number.
It is not a de Polignac number, because 51110135205641 - 226 = 51110068096777 is a prime.
It is a super-2 number, since 2×511101352056412 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (51110135205841) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25555067602820 + 25555067602821.
It is an arithmetic number, because the mean of its divisors is an integer number (25555067602821).
Almost surely, 251110135205641 is an apocalyptic number.
It is an amenable number.
51110135205641 is a deficient number, since it is larger than the sum of its proper divisors (1).
51110135205641 is an equidigital number, since it uses as much as digits as its factorization.
51110135205641 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 18000, while the sum is 35.
Adding to 51110135205641 its reverse (14650253101115), we get a palindrome (65760388306756).
The spelling of 51110135205641 in words is "fifty-one trillion, one hundred ten billion, one hundred thirty-five million, two hundred five thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •