Base | Representation |
---|---|
bin | 1001101100110011011… |
… | …0010101100000000000 |
3 | 120221010211000020010011 |
4 | 2123030312111200000 |
5 | 10212242230200102 |
6 | 204320024314304 |
7 | 15016426554511 |
oct | 2331466254000 |
9 | 527124006104 |
10 | 166645553152 |
11 | 64746085651 |
12 | 28369312994 |
13 | 12939cc05b0 |
14 | 80cc366a08 |
15 | 45050e02d7 |
hex | 26ccd95800 |
166645553152 has 96 divisors (see below), whose sum is σ = 359190795600. Its totient is φ = 76838436864.
The previous prime is 166645553117. The next prime is 166645553161. The reversal of 166645553152 is 251355546661.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 166645553096 and 166645553105.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 34795174 + ... + 34799962.
Almost surely, 2166645553152 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 166645553152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (179595397800).
166645553152 is an abundant number, since it is smaller than the sum of its proper divisors (192545242448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
166645553152 is a wasteful number, since it uses less digits than its factorization.
166645553152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6131 (or 6111 counting only the distinct ones).
The product of its digits is 3240000, while the sum is 49.
The spelling of 166645553152 in words is "one hundred sixty-six billion, six hundred forty-five million, five hundred fifty-three thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •