Base | Representation |
---|---|
bin | 1001001001110001100100… |
… | …10101100010111000000011 |
3 | 2122021010110111122011202022 |
4 | 10210320302111202320003 |
5 | 10114230210140221411 |
6 | 110450124433512055 |
7 | 4145063224626341 |
oct | 444706225427003 |
9 | 78233414564668 |
10 | 20127061257731 |
11 | 645a92540664a |
12 | 231091411262b |
13 | b2cc873a15cc |
14 | 4d8225308991 |
15 | 24d83ec05edb |
hex | 124e32562e03 |
20127061257731 has 2 divisors, whose sum is σ = 20127061257732. Its totient is φ = 20127061257730.
The previous prime is 20127061257713. The next prime is 20127061257757. The reversal of 20127061257731 is 13775216072102.
Together with previous prime (20127061257713) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20127061257731 is a prime.
It is a super-2 number, since 2×201270612577312 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20127061257791) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10063530628865 + 10063530628866.
It is an arithmetic number, because the mean of its divisors is an integer number (10063530628866).
Almost surely, 220127061257731 is an apocalyptic number.
20127061257731 is a deficient number, since it is larger than the sum of its proper divisors (1).
20127061257731 is an equidigital number, since it uses as much as digits as its factorization.
20127061257731 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 246960, while the sum is 44.
The spelling of 20127061257731 in words is "twenty trillion, one hundred twenty-seven billion, sixty-one million, two hundred fifty-seven thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •