Base | Representation |
---|---|
bin | 111101100001100000… |
… | …110110011101001011 |
3 | 20022111212111122222111 |
4 | 331201200312131023 |
5 | 2040242442323201 |
6 | 50203042003151 |
7 | 4526020036063 |
oct | 754140663513 |
9 | 208455448874 |
10 | 66060511051 |
11 | 2601a488787 |
12 | 109776464b7 |
13 | 62ca2216c2 |
14 | 32a97343a3 |
15 | 1ab983eb51 |
hex | f6183674b |
66060511051 has 2 divisors, whose sum is σ = 66060511052. Its totient is φ = 66060511050.
The previous prime is 66060511031. The next prime is 66060511081. The reversal of 66060511051 is 15011506066.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 66060511051 - 229 = 65523640139 is a prime.
It is a super-2 number, since 2×660605110512 (a number of 22 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (66060511001) 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, 33030255525 + 33030255526.
It is an arithmetic number, because the mean of its divisors is an integer number (33030255526).
Almost surely, 266060511051 is an apocalyptic number.
66060511051 is a deficient number, since it is larger than the sum of its proper divisors (1).
66060511051 is an equidigital number, since it uses as much as digits as its factorization.
66060511051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5400, while the sum is 31.
The spelling of 66060511051 in words is "sixty-six billion, sixty million, five hundred eleven thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •