Base | Representation |
---|---|
bin | 1001001111110001011010… |
… | …0101101011100011010101 |
3 | 1022222220200111121112002012 |
4 | 2103330112211223203111 |
5 | 2313032112020103401 |
6 | 33342242312354005 |
7 | 2066336665655141 |
oct | 223742645534325 |
9 | 38886614545065 |
10 | 10166566566101 |
11 | 326a68686a510 |
12 | 11824226a5905 |
13 | 58991a9817ca |
14 | 2720c8bb4221 |
15 | 1296c812e8bb |
hex | 93f1696b8d5 |
10166566566101 has 16 divisors (see below), whose sum is σ = 11358568858560. Its totient is φ = 9019565291520.
The previous prime is 10166566566083. The next prime is 10166566566179.
10166566566101 is nontrivially palindromic in base 10.
It is a cyclic number.
It is not a de Polignac number, because 10166566566101 - 214 = 10166566549717 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 10166566566101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10166566569101) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8775446 + ... + 9866183.
It is an arithmetic number, because the mean of its divisors is an integer number (709910553660).
Almost surely, 210166566566101 is an apocalyptic number.
10166566566101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
10166566566101 is a deficient number, since it is larger than the sum of its proper divisors (1192002292459).
10166566566101 is a wasteful number, since it uses less digits than its factorization.
10166566566101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18642836.
The product of its (nonzero) digits is 1166400, while the sum is 50.
The spelling of 10166566566101 in words is "ten trillion, one hundred sixty-six billion, five hundred sixty-six million, five hundred sixty-six thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •