Base | Representation |
---|---|
bin | 1001100110000111110… |
… | …1010110001011000101 |
3 | 120202111211112220120220 |
4 | 2121201331112023011 |
5 | 10200104132310210 |
6 | 203422043214553 |
7 | 14624122552605 |
oct | 2314175261305 |
9 | 522454486526 |
10 | 164852228805 |
11 | 63a05870510 |
12 | 27b48817459 |
13 | 127125c9c24 |
14 | 7d9c10ac05 |
15 | 444c954c70 |
hex | 2661f562c5 |
164852228805 has 32 divisors (see below), whose sum is σ = 302886397440. Its totient is φ = 75721596480.
The previous prime is 164852228803. The next prime is 164852228813. The reversal of 164852228805 is 508822258461.
164852228805 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 164852228805 - 21 = 164852228803 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (164852228803) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 26289087 + ... + 26295356.
It is an arithmetic number, because the mean of its divisors is an integer number (9465199920).
Almost surely, 2164852228805 is an apocalyptic number.
164852228805 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
164852228805 is a deficient number, since it is larger than the sum of its proper divisors (138034168635).
164852228805 is a wasteful number, since it uses less digits than its factorization.
164852228805 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52584481.
The product of its (nonzero) digits is 2457600, while the sum is 51.
The spelling of 164852228805 in words is "one hundred sixty-four billion, eight hundred fifty-two million, two hundred twenty-eight thousand, eight hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •