Base | Representation |
---|---|
bin | 111101100100111… |
… | …0011000101100010 |
3 | 12022222212010001220 |
4 | 1323021303011202 |
5 | 13212414303424 |
6 | 541005035510 |
7 | 102126056625 |
oct | 17311630542 |
9 | 5288763056 |
10 | 2066166114 |
11 | 97032a201 |
12 | 497b55b96 |
13 | 26c0a2acc |
14 | 15859ddbc |
15 | c15d2579 |
hex | 7b273162 |
2066166114 has 8 divisors (see below), whose sum is σ = 4132332240. Its totient is φ = 688722036.
The previous prime is 2066166083. The next prime is 2066166119. The reversal of 2066166114 is 4116616602.
It is a happy number.
2066166114 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
2066166114 is an admirable number.
It is a super-4 number, since 4×20661661144 (a number of 38 digits) contains 4444 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2066166119) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 172180504 + ... + 172180515.
It is an arithmetic number, because the mean of its divisors is an integer number (516541530).
Almost surely, 22066166114 is an apocalyptic number.
2066166114 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2066166114 is a wasteful number, since it uses less digits than its factorization.
2066166114 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 344361024.
The product of its (nonzero) digits is 10368, while the sum is 33.
The square root of 2066166114 is about 45455.0999778903. The cubic root of 2066166114 is about 1273.6645998274.
The spelling of 2066166114 in words is "two billion, sixty-six million, one hundred sixty-six thousand, one hundred fourteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •