Base | Representation |
---|---|
bin | 10011110100000… |
… | …01011001101000 |
3 | 102120202002102221 |
4 | 21322001121220 |
5 | 320022030112 |
6 | 24254203424 |
7 | 4055501530 |
oct | 1172013150 |
9 | 376662387 |
10 | 166205032 |
11 | 85900334 |
12 | 477b3574 |
13 | 28583b96 |
14 | 181064c0 |
15 | e8d0e07 |
hex | 9e81668 |
166205032 has 64 divisors (see below), whose sum is σ = 375580800. Its totient is φ = 67441920.
The previous prime is 166205009. The next prime is 166205041. The reversal of 166205032 is 230502661.
It is a super-2 number, since 2×1662050322 = 55248225324242048, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 166204988 and 166205006.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 85107 + ... + 87037.
It is an arithmetic number, because the mean of its divisors is an integer number (5868450).
Almost surely, 2166205032 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 166205032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (187790400).
166205032 is an abundant number, since it is smaller than the sum of its proper divisors (209375768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
166205032 is a wasteful number, since it uses less digits than its factorization.
166205032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2026 (or 2022 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 25.
The square root of 166205032 is about 12892.0530560497. The cubic root of 166205032 is about 549.8126436227.
Adding to 166205032 its reverse (230502661), we get a palindrome (396707693).
The spelling of 166205032 in words is "one hundred sixty-six million, two hundred five thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •