Base | Representation |
---|---|
bin | 100101110001001110001000… |
… | …111000000001011010000001 |
3 | 210210010222100102020122110210 |
4 | 211301032020320001122001 |
5 | 133233022100034410001 |
6 | 1345141541421344333 |
7 | 46663030350123603 |
oct | 4561161070013201 |
9 | 723128312218423 |
10 | 166110156560001 |
11 | 48a22a15993675 |
12 | 167693174080a9 |
13 | 718c174b08b74 |
14 | 2d03abb233173 |
15 | 1430d8e02add6 |
hex | 971388e01681 |
166110156560001 has 4 divisors (see below), whose sum is σ = 221480208746672. Its totient is φ = 110740104373332.
The previous prime is 166110156559981. The next prime is 166110156560041. The reversal of 166110156560001 is 100065651011661.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 166110156560001 - 25 = 166110156559969 is a prime.
It is a super-2 number, since 2×1661101565600012 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (166110156560041) 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, 27685026093331 + ... + 27685026093336.
It is an arithmetic number, because the mean of its divisors is an integer number (55370052186668).
Almost surely, 2166110156560001 is an apocalyptic number.
It is an amenable number.
166110156560001 is a deficient number, since it is larger than the sum of its proper divisors (55370052186671).
166110156560001 is an equidigital number, since it uses as much as digits as its factorization.
166110156560001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55370052186670.
The product of its (nonzero) digits is 32400, while the sum is 39.
The spelling of 166110156560001 in words is "one hundred sixty-six trillion, one hundred ten billion, one hundred fifty-six million, five hundred sixty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •