Base | Representation |
---|---|
bin | 11110000010011111000100… |
… | …11000001111110010011111 |
3 | 22122212220100012001222212212 |
4 | 33001033202120033302133 |
5 | 32124230343103132002 |
6 | 352253430424151035 |
7 | 16625252511141113 |
oct | 1701174230176237 |
9 | 278786305058785 |
10 | 66056100052127 |
11 | 1a058264444aa9 |
12 | 74aa14630847b |
13 | 2ab20a96a81b3 |
14 | 12451bd06b743 |
15 | 79840dbcd352 |
hex | 3c13e260fc9f |
66056100052127 has 2 divisors, whose sum is σ = 66056100052128. Its totient is φ = 66056100052126.
The previous prime is 66056100052079. The next prime is 66056100052141. The reversal of 66056100052127 is 72125000165066.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 66056100052127 - 28 = 66056100051871 is a prime.
It is a super-2 number, since 2×660561000521272 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (66056100052027) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 33028050026063 + 33028050026064.
It is an arithmetic number, because the mean of its divisors is an integer number (33028050026064).
Almost surely, 266056100052127 is an apocalyptic number.
66056100052127 is a deficient number, since it is larger than the sum of its proper divisors (1).
66056100052127 is an equidigital number, since it uses as much as digits as its factorization.
66056100052127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 151200, while the sum is 41.
The spelling of 66056100052127 in words is "sixty-six trillion, fifty-six billion, one hundred million, fifty-two thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •