Base | Representation |
---|---|
bin | 100101101111110010010001… |
… | …001001011111111110000001 |
3 | 210202210112201122102122122002 |
4 | 211233302101021133332001 |
5 | 133224413033321032203 |
6 | 1345024345123153345 |
7 | 46652636001501152 |
oct | 4557622111377601 |
9 | 722715648378562 |
10 | 166011511111553 |
11 | 489950a5125168 |
12 | 16752187215855 |
13 | 7182a83b24423 |
14 | 2cdd000053929 |
15 | 142d518ba9d88 |
hex | 96fc9125ff81 |
166011511111553 has 8 divisors (see below), whose sum is σ = 168745325145600. Its totient is φ = 163295165538288.
The previous prime is 166011511111549. The next prime is 166011511111597. The reversal of 166011511111553 is 355111115110661.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 166011511111553 - 22 = 166011511111549 is a prime.
It is a super-2 number, since 2×1660115111115532 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (166011511111153) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4367096033 + ... + 4367134046.
It is an arithmetic number, because the mean of its divisors is an integer number (21093165643200).
Almost surely, 2166011511111553 is an apocalyptic number.
It is an amenable number.
166011511111553 is a deficient number, since it is larger than the sum of its proper divisors (2733814034047).
166011511111553 is an equidigital number, since it uses as much as digits as its factorization.
166011511111553 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8734230391.
The product of its (nonzero) digits is 13500, while the sum is 38.
The spelling of 166011511111553 in words is "one hundred sixty-six trillion, eleven billion, five hundred eleven million, one hundred eleven thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •