Base | Representation |
---|---|
bin | 11110011101100101000001… |
… | …11111111101010000100111 |
3 | 22210011220011222101102122202 |
4 | 33032302200333331100213 |
5 | 32240003344313201332 |
6 | 354245224050045115 |
7 | 20052436403212223 |
oct | 1716624077752047 |
9 | 283156158342582 |
10 | 66987011068967 |
11 | 1a387039445300 |
12 | 761a64657979b |
13 | 2b4bb041ac3c2 |
14 | 127828d885783 |
15 | 7b2744cd9a62 |
hex | 3ceca0ffd427 |
66987011068967 has 12 divisors (see below), whose sum is σ = 76831670622000. Its totient is φ = 58249574840160.
The previous prime is 66987011068961. The next prime is 66987011068969. The reversal of 66987011068967 is 76986011078966.
It is not a de Polignac number, because 66987011068967 - 24 = 66987011068951 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 66987011068894 and 66987011068903.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (66987011068961) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 12035033342 + ... + 12035038907.
It is an arithmetic number, because the mean of its divisors is an integer number (6402639218500).
Almost surely, 266987011068967 is an apocalyptic number.
66987011068967 is a deficient number, since it is larger than the sum of its proper divisors (9844659553033).
66987011068967 is a wasteful number, since it uses less digits than its factorization.
66987011068967 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24070072294 (or 24070072283 counting only the distinct ones).
The product of its (nonzero) digits is 329204736, while the sum is 74.
Subtracting 66987011068967 from its reverse (76986011078966), we obtain a palindrome (9999000009999).
The spelling of 66987011068967 in words is "sixty-six trillion, nine hundred eighty-seven billion, eleven million, sixty-eight thousand, nine hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •