Base | Representation |
---|---|
bin | 100101101111101100010011… |
… | …010111111101101001001101 |
3 | 210202202221012021002121102220 |
4 | 211233230103113331221031 |
5 | 133224311424114202410 |
6 | 1345021405355405553 |
7 | 46652321165136615 |
oct | 4557542327755115 |
9 | 722687167077386 |
10 | 166005106006605 |
11 | 48992408661aa8 |
12 | 16750a9a1538b9 |
13 | 71822a2b4a5b8 |
14 | 2cdc993511a45 |
15 | 142d291701070 |
hex | 96fb135fda4d |
166005106006605 has 64 divisors (see below), whose sum is σ = 284788652156928. Its totient is φ = 82356847752960.
The previous prime is 166005106006573. The next prime is 166005106006637. The reversal of 166005106006605 is 506600601500661.
It is an interprime number because it is at equal distance from previous prime (166005106006573) and next prime (166005106006637).
It is not a de Polignac number, because 166005106006605 - 25 = 166005106006573 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 22437022 + ... + 28903808.
It is an arithmetic number, because the mean of its divisors is an integer number (4449822689952).
Almost surely, 2166005106006605 is an apocalyptic number.
166005106006605 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
166005106006605 is a deficient number, since it is larger than the sum of its proper divisors (118783546150323).
166005106006605 is a wasteful number, since it uses less digits than its factorization.
166005106006605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6468866.
The product of its (nonzero) digits is 194400, while the sum is 42.
The spelling of 166005106006605 in words is "one hundred sixty-six trillion, five billion, one hundred six million, six thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •