Base | Representation |
---|---|
bin | 10011110110010… |
… | …10111001000000 |
3 | 102121022101100200 |
4 | 21323022321000 |
5 | 320111143143 |
6 | 24304445200 |
7 | 4061164242 |
oct | 1173127100 |
9 | 377271320 |
10 | 166506048 |
11 | 85a96505 |
12 | 47919800 |
13 | 2865abb7 |
14 | 18184092 |
15 | e9401d3 |
hex | 9ecae40 |
166506048 has 84 divisors (see below), whose sum is σ = 479054160. Its totient is φ = 55293696.
The previous prime is 166506047. The next prime is 166506059. The reversal of 166506048 is 840605661.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (166506047) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 268683 + ... + 269301.
Almost surely, 2166506048 is an apocalyptic number.
166506048 is a gapful number since it is divisible by the number (18) 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 166506048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (239527080).
166506048 is an abundant number, since it is smaller than the sum of its proper divisors (312548112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
166506048 is a wasteful number, since it uses less digits than its factorization.
166506048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1104 (or 1091 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 36.
The square root of 166506048 is about 12903.7222536755. The cubic root of 166506048 is about 550.1443676118.
The spelling of 166506048 in words is "one hundred sixty-six million, five hundred six thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •