Base | Representation |
---|---|
bin | 1001101010011110110… |
… | …1101101011111101000 |
3 | 120212112101200122002010 |
4 | 2122213231231133220 |
5 | 10210003232111034 |
6 | 204134131035520 |
7 | 14665123156464 |
oct | 2324755553750 |
9 | 525471618063 |
10 | 166022535144 |
11 | 64456435a34 |
12 | 2821473bba0 |
13 | 1286abc599b |
14 | 806d70b4a4 |
15 | 44ba5773e9 |
hex | 26a7b6d7e8 |
166022535144 has 32 divisors (see below), whose sum is σ = 421860543840. Its totient is φ = 54433617600.
The previous prime is 166022535131. The next prime is 166022535149. The reversal of 166022535144 is 441535220661.
166022535144 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Smith number, since the sum of its digits (39) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (166022535149) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 56700222 + ... + 56703149.
It is an arithmetic number, because the mean of its divisors is an integer number (13183141995).
Almost surely, 2166022535144 is an apocalyptic number.
It is an amenable number.
166022535144 is an abundant number, since it is smaller than the sum of its proper divisors (255838008696).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
166022535144 is a wasteful number, since it uses less digits than its factorization.
166022535144 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113403441 (or 113403437 counting only the distinct ones).
The product of its (nonzero) digits is 172800, while the sum is 39.
The spelling of 166022535144 in words is "one hundred sixty-six billion, twenty-two million, five hundred thirty-five thousand, one hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •