Base | Representation |
---|---|
bin | 1001101010011011111… |
… | …1100110000100011000 |
3 | 120212111112221110000220 |
4 | 2122212333212010120 |
5 | 10204442133233404 |
6 | 204133020000040 |
7 | 14664615336456 |
oct | 2324677460430 |
9 | 525445843026 |
10 | 166010446104 |
11 | 6444a629298 |
12 | 28210690020 |
13 | 128685522c9 |
14 | 806bc819d6 |
15 | 44b948a4d9 |
hex | 26a6fe6118 |
166010446104 has 64 divisors (see below), whose sum is σ = 423562335840. Its totient is φ = 54202137600.
The previous prime is 166010446061. The next prime is 166010446127. The reversal of 166010446104 is 401644010661.
166010446104 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 655894 + ... + 873050.
Almost surely, 2166010446104 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 166010446104, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (211781167920).
166010446104 is an abundant number, since it is smaller than the sum of its proper divisors (257551889736).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
166010446104 is a wasteful number, since it uses less digits than its factorization.
166010446104 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 217820 (or 217816 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 33.
Adding to 166010446104 its reverse (401644010661), we get a palindrome (567654456765).
The spelling of 166010446104 in words is "one hundred sixty-six billion, ten million, four hundred forty-six thousand, one hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •