Base | Representation |
---|---|
bin | 1010000000100110101011… |
… | …11001010101001010100001 |
3 | 2212221020020111122002102211 |
4 | 11000103111321111022201 |
5 | 10341112012224004414 |
6 | 114451414140442121 |
7 | 4431146060341015 |
oct | 500232571251241 |
9 | 85836214562384 |
10 | 22011001000609 |
11 | 70168a426a465 |
12 | 2575a67849341 |
13 | c38822a3300a |
14 | 5614a3b9c545 |
15 | 282853a4e3c4 |
hex | 1404d5e552a1 |
22011001000609 has 2 divisors, whose sum is σ = 22011001000610. Its totient is φ = 22011001000608.
The previous prime is 22011001000603. The next prime is 22011001000613. The reversal of 22011001000609 is 90600010011022.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 15469314941025 + 6541686059584 = 3933105^2 + 2557672^2 .
It is a cyclic number.
It is not a de Polignac number, because 22011001000609 - 211 = 22011000998561 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 22011001000609.
It is not a weakly prime, because it can be changed into another prime (22011001000603) 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 as a sum of consecutive naturals, namely, 11005500500304 + 11005500500305.
It is an arithmetic number, because the mean of its divisors is an integer number (11005500500305).
Almost surely, 222011001000609 is an apocalyptic number.
It is an amenable number.
22011001000609 is a deficient number, since it is larger than the sum of its proper divisors (1).
22011001000609 is an equidigital number, since it uses as much as digits as its factorization.
22011001000609 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 22.
The spelling of 22011001000609 in words is "twenty-two trillion, eleven billion, one million, six hundred nine", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •