Base | Representation |
---|---|
bin | 11110010101001110100100… |
… | …00001011100100010110111 |
3 | 22202011110112121112010102102 |
4 | 33022213102001130202313 |
5 | 32220303221101442012 |
6 | 353505331154532315 |
7 | 20022630634465004 |
oct | 1712472201344267 |
9 | 282143477463372 |
10 | 66700070734007 |
11 | 1a286383075707 |
12 | 7592b0689709b |
13 | 2b2aa35c12b59 |
14 | 126842cda08ab |
15 | 7aa04de162c2 |
hex | 3ca9d205c8b7 |
66700070734007 has 2 divisors, whose sum is σ = 66700070734008. Its totient is φ = 66700070734006.
The previous prime is 66700070733983. The next prime is 66700070734009. The reversal of 66700070734007 is 70043707000766.
It is a happy number.
66700070734007 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 66700070734007 - 218 = 66700070471863 is a prime.
Together with 66700070734009, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (66700070734009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 33350035367003 + 33350035367004.
It is an arithmetic number, because the mean of its divisors is an integer number (33350035367004).
Almost surely, 266700070734007 is an apocalyptic number.
66700070734007 is a deficient number, since it is larger than the sum of its proper divisors (1).
66700070734007 is an equidigital number, since it uses as much as digits as its factorization.
66700070734007 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1037232, while the sum is 47.
The spelling of 66700070734007 in words is "sixty-six trillion, seven hundred billion, seventy million, seven hundred thirty-four thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •