Base | Representation |
---|---|
bin | 111110000110000101… |
… | …011000011000111111 |
3 | 20101002122000112112011 |
4 | 332012011120120333 |
5 | 2043022030121012 |
6 | 50344000352051 |
7 | 4550150135002 |
oct | 760605303077 |
9 | 211078015464 |
10 | 66674067007 |
11 | 26304855419 |
12 | 10b09015627 |
13 | 6397385572 |
14 | 3327009539 |
15 | 1b036391a7 |
hex | f8615863f |
66674067007 has 8 divisors (see below), whose sum is σ = 68634228656. Its totient is φ = 64722229632.
The previous prime is 66674067001. The next prime is 66674067013. The reversal of 66674067007 is 70076047666.
It is an interprime number because it is at equal distance from previous prime (66674067001) and next prime (66674067013).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 66674067007 - 215 = 66674034239 is a prime.
It is a super-2 number, since 2×666740670072 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (66674067001) 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 in 7 ways as a sum of consecutive naturals, for example, 2064813 + ... + 2096854.
It is an arithmetic number, because the mean of its divisors is an integer number (8579278582).
Almost surely, 266674067007 is an apocalyptic number.
66674067007 is a deficient number, since it is larger than the sum of its proper divisors (1960161649).
66674067007 is a wasteful number, since it uses less digits than its factorization.
66674067007 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4162137.
The product of its (nonzero) digits is 1778112, while the sum is 49.
The spelling of 66674067007 in words is "sixty-six billion, six hundred seventy-four million, sixty-seven thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •