Base | Representation |
---|---|
bin | 11110010101001111101011… |
… | …01111011101111110001101 |
3 | 22202011112002101011001020121 |
4 | 33022213311233131332031 |
5 | 32220310433010013122 |
6 | 353505510443144541 |
7 | 20022651532252132 |
oct | 1712476557357615 |
9 | 282145071131217 |
10 | 66700670001037 |
11 | 1a286660372916 |
12 | 7593053515151 |
13 | 2b2ab00112c27 |
14 | 12684887d6589 |
15 | 7aa08683bbc7 |
hex | 3ca9f5bddf8d |
66700670001037 has 2 divisors, whose sum is σ = 66700670001038. Its totient is φ = 66700670001036.
The previous prime is 66700670001023. The next prime is 66700670001041. The reversal of 66700670001037 is 73010007600766.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 65133519045156 + 1567150955881 = 8070534^2 + 1251859^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-66700670001037 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 66700670000984 and 66700670001002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (66700670001067) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 33350335000518 + 33350335000519.
It is an arithmetic number, because the mean of its divisors is an integer number (33350335000519).
Almost surely, 266700670001037 is an apocalyptic number.
It is an amenable number.
66700670001037 is a deficient number, since it is larger than the sum of its proper divisors (1).
66700670001037 is an equidigital number, since it uses as much as digits as its factorization.
66700670001037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 222264, while the sum is 43.
The spelling of 66700670001037 in words is "sixty-six trillion, seven hundred billion, six hundred seventy million, one thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •