Base | Representation |
---|---|
bin | 100101110111010101010001… |
… | …000000101100110111001100 |
3 | 210211122010100211001001202121 |
4 | 211313111101000230313030 |
5 | 133311412144240343220 |
6 | 1350102514522302324 |
7 | 50035255524302533 |
oct | 4567252100546714 |
9 | 724563324031677 |
10 | 166530126106060 |
11 | 49075036834542 |
12 | 168167a23579a4 |
13 | 71bc95371b342 |
14 | 2d1a15b63131a |
15 | 143bc6db76eaa |
hex | 97755102cdcc |
166530126106060 has 24 divisors (see below), whose sum is σ = 349714200588480. Its totient is φ = 66611872201344.
The previous prime is 166530126106049. The next prime is 166530126106177. The reversal of 166530126106060 is 60601621035661.
It is a junction number, because it is equal to n+sod(n) for n = 166530126105998 and 166530126106016.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3345825 + ... + 18554104.
It is an arithmetic number, because the mean of its divisors is an integer number (14571425024520).
Almost surely, 2166530126106060 is an apocalyptic number.
166530126106060 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
166530126106060 is an abundant number, since it is smaller than the sum of its proper divisors (183184074482420).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
166530126106060 is a wasteful number, since it uses less digits than its factorization.
166530126106060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22280145 (or 22280143 counting only the distinct ones).
The product of its (nonzero) digits is 233280, while the sum is 43.
The spelling of 166530126106060 in words is "one hundred sixty-six trillion, five hundred thirty billion, one hundred twenty-six million, one hundred six thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •