Base | Representation |
---|---|
bin | 10100101011110000… |
… | …110000110101010101 |
3 | 2010022210020010000222 |
4 | 110223300300311111 |
5 | 330441003232301 |
6 | 14111440444125 |
7 | 1414234502612 |
oct | 245360606525 |
9 | 63283203028 |
10 | 22209039701 |
11 | 9467473272 |
12 | 4379919645 |
13 | 212c252a14 |
14 | 1109837509 |
15 | 89eb7131b |
hex | 52bc30d55 |
22209039701 has 4 divisors (see below), whose sum is σ = 22212293004. Its totient is φ = 22205786400.
The previous prime is 22209039691. The next prime is 22209039703. The reversal of 22209039701 is 10793090222.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 10793090222 = 2 ⋅5396545111.
It can be written as a sum of positive squares in 2 ways, for example, as 10512400900 + 11696638801 = 102530^2 + 108151^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22209039701 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (22209039703) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1616390 + ... + 1630071.
It is an arithmetic number, because the mean of its divisors is an integer number (5553073251).
Almost surely, 222209039701 is an apocalyptic number.
It is an amenable number.
22209039701 is a deficient number, since it is larger than the sum of its proper divisors (3253303).
22209039701 is an equidigital number, since it uses as much as digits as its factorization.
22209039701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3253302.
The product of its (nonzero) digits is 13608, while the sum is 35.
The spelling of 22209039701 in words is "twenty-two billion, two hundred nine million, thirty-nine thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •