Base | Representation |
---|---|
bin | 10011111000001… |
… | …10011111001000 |
3 | 102121202210012120 |
4 | 21330012133020 |
5 | 320142001102 |
6 | 24314011240 |
7 | 4063232022 |
oct | 1174063710 |
9 | 377683176 |
10 | 166750152 |
11 | 86142948 |
12 | 47a16b20 |
13 | 2871503a |
14 | 18209012 |
15 | e98c6bc |
hex | 9f067c8 |
166750152 has 16 divisors (see below), whose sum is σ = 416875440. Its totient is φ = 55583376.
The previous prime is 166750151. The next prime is 166750159. The reversal of 166750152 is 251057661.
166750152 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×1667501523 (a number of 26 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not an unprimeable number, because it can be changed into a prime (166750151) 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, 3473938 + ... + 3473985.
It is an arithmetic number, because the mean of its divisors is an integer number (26054715).
Almost surely, 2166750152 is an apocalyptic number.
166750152 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
166750152 is an abundant number, since it is smaller than the sum of its proper divisors (250125288).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
166750152 is a wasteful number, since it uses less digits than its factorization.
166750152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6947932 (or 6947928 counting only the distinct ones).
The product of its (nonzero) digits is 12600, while the sum is 33.
The square root of 166750152 is about 12913.1774556071. The cubic root of 166750152 is about 550.4130803099.
The spelling of 166750152 in words is "one hundred sixty-six million, seven hundred fifty thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •