Base | Representation |
---|---|
bin | 111101100100011101… |
… | …101001000000101111 |
3 | 20022122022122000200221 |
4 | 331210131221000233 |
5 | 2040343130014244 |
6 | 50212010432211 |
7 | 4530160511164 |
oct | 754435510057 |
9 | 208568560627 |
10 | 66110001199 |
11 | 26045410430 |
12 | 10990132667 |
13 | 630755ba08 |
14 | 32b213806b |
15 | 1abdd68784 |
hex | f6476902f |
66110001199 has 4 divisors (see below), whose sum is σ = 72120001320. Its totient is φ = 60100001080.
The previous prime is 66110001187. The next prime is 66110001211. The reversal of 66110001199 is 99110001166.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (66110001187) and next prime (66110001211).
It is a cyclic number.
It is not a de Polignac number, because 66110001199 - 213 = 66109993007 is a prime.
66110001199 is a strobogrammatic number because it is the same when read upside-down.
It is a Duffinian number.
It is a zygodrome in base 10.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (66110001169) 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 3 ways as a sum of consecutive naturals, for example, 3005000044 + ... + 3005000065.
It is an arithmetic number, because the mean of its divisors is an integer number (18030000330).
Almost surely, 266110001199 is an apocalyptic number.
66110001199 is a deficient number, since it is larger than the sum of its proper divisors (6010000121).
66110001199 is a wasteful number, since it uses less digits than its factorization.
66110001199 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6010000120.
The product of its (nonzero) digits is 2916, while the sum is 34.
The spelling of 66110001199 in words is "sixty-six billion, one hundred ten million, one thousand, one hundred ninety-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •