Base | Representation |
---|---|
bin | 1111100001010001… |
… | …0010001100111111 |
3 | 101202100012010120001 |
4 | 3320110102030333 |
5 | 32013003121012 |
6 | 1525221135131 |
7 | 205144661644 |
oct | 37024221477 |
9 | 11670163501 |
10 | 4166067007 |
11 | 18486aa893 |
12 | 98325a4a7 |
13 | 51515780b |
14 | 2b7421dcb |
15 | 195b2a357 |
hex | f851233f |
4166067007 has 4 divisors (see below), whose sum is σ = 4309724520. Its totient is φ = 4022409496.
The previous prime is 4166067001. The next prime is 4166067019. The reversal of 4166067007 is 7007606614.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 7007606614 = 2 ⋅3503803307.
It is a cyclic number.
It is not a de Polignac number, because 4166067007 - 23 = 4166066999 is a prime.
It is a super-2 number, since 2×41660670072 = 34712228613627876098, which 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 (4166067001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 71828713 + ... + 71828770.
It is an arithmetic number, because the mean of its divisors is an integer number (1077431130).
Almost surely, 24166067007 is an apocalyptic number.
4166067007 is a deficient number, since it is larger than the sum of its proper divisors (143657513).
4166067007 is a wasteful number, since it uses less digits than its factorization.
4166067007 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 143657512.
The product of its (nonzero) digits is 42336, while the sum is 37.
The square root of 4166067007 is about 64545.0773258503. The cubic root of 4166067007 is about 1609.0717753001.
The spelling of 4166067007 in words is "four billion, one hundred sixty-six million, sixty-seven thousand, seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •