Base | Representation |
---|---|
bin | 1001101010111110100… |
… | …0000100100101000000 |
3 | 120212212122110111022210 |
4 | 2122233220010211000 |
5 | 10210241222241220 |
6 | 204155232102120 |
7 | 15001324350042 |
oct | 2325750044500 |
9 | 525778414283 |
10 | 166155274560 |
11 | 64514359030 |
12 | 28251094940 |
13 | 1288c560312 |
14 | 80831c1a92 |
15 | 44c70476e0 |
hex | 26afa04940 |
166155274560 has 448 divisors, whose sum is σ = 619384713984. Its totient is φ = 37286707200.
The previous prime is 166155274547. The next prime is 166155274561. The reversal of 166155274560 is 65472551661.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (166155274561) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 10943134 + ... + 10958306.
Almost surely, 2166155274560 is an apocalyptic number.
166155274560 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 166155274560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (309692356992).
166155274560 is an abundant number, since it is smaller than the sum of its proper divisors (453229439424).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
166155274560 is a wasteful number, since it uses less digits than its factorization.
166155274560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15282 (or 15272 counting only the distinct ones).
The product of its (nonzero) digits is 1512000, while the sum is 48.
The spelling of 166155274560 in words is "one hundred sixty-six billion, one hundred fifty-five million, two hundred seventy-four thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •