Base | Representation |
---|---|
bin | 10011110101110… |
… | …01010010100000 |
3 | 102121011201110110 |
4 | 21322321102200 |
5 | 320101341302 |
6 | 24303131320 |
7 | 4060444116 |
oct | 1172712240 |
9 | 377151413 |
10 | 166433952 |
11 | 85a47323 |
12 | 478a3b40 |
13 | 28634139 |
14 | 18165ab6 |
15 | e928b6c |
hex | 9eb94a0 |
166433952 has 48 divisors (see below), whose sum is σ = 437633280. Its totient is φ = 55383552.
The previous prime is 166433879. The next prime is 166433959. The reversal of 166433952 is 259334661.
It is a tau number, because it is divible by the number of its divisors (48).
It is a self number, because there is not a number n which added to its sum of digits gives 166433952.
It is not an unprimeable number, because it can be changed into a prime (166433959) 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 7 ways as a sum of consecutive naturals, for example, 76593 + ... + 78735.
It is an arithmetic number, because the mean of its divisors is an integer number (9117360).
Almost surely, 2166433952 is an apocalyptic number.
166433952 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
166433952 is an abundant number, since it is smaller than the sum of its proper divisors (271199328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
166433952 is a wasteful number, since it uses less digits than its factorization.
166433952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2965 (or 2957 counting only the distinct ones).
The product of its digits is 116640, while the sum is 39.
The square root of 166433952 is about 12900.9283386894. The cubic root of 166433952 is about 550.0649532105.
The spelling of 166433952 in words is "one hundred sixty-six million, four hundred thirty-three thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •