Base | Representation |
---|---|
bin | 1001100101101000110… |
… | …1111010111111110001 |
3 | 120202011210011200212202 |
4 | 2121122031322333301 |
5 | 10144322410344314 |
6 | 203401123432545 |
7 | 14620654632365 |
oct | 2313215727761 |
9 | 522153150782 |
10 | 164722356209 |
11 | 63949526294 |
12 | 27b11225755 |
13 | 126c1727438 |
14 | 7d88b812a5 |
15 | 444134e0de |
hex | 265a37aff1 |
164722356209 has 8 divisors (see below), whose sum is σ = 166997048232. Its totient is φ = 162448156800.
The previous prime is 164722356203. The next prime is 164722356241. The reversal of 164722356209 is 902653227461.
It can be written as a sum of positive squares in 4 ways, for example, as 2945449984 + 161776906225 = 54272^2 + 402215^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 164722356209 - 28 = 164722355953 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (164722356203) 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, 577559 + ... + 814259.
It is an arithmetic number, because the mean of its divisors is an integer number (20874631029).
Almost surely, 2164722356209 is an apocalyptic number.
It is an amenable number.
164722356209 is a deficient number, since it is larger than the sum of its proper divisors (2274692023).
164722356209 is an equidigital number, since it uses as much as digits as its factorization.
164722356209 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 246307.
The product of its (nonzero) digits is 1088640, while the sum is 47.
The spelling of 164722356209 in words is "one hundred sixty-four billion, seven hundred twenty-two million, three hundred fifty-six thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •