Base | Representation |
---|---|
bin | 10101000110111000… |
… | …101010110101000001 |
3 | 2011111111111102102022 |
4 | 111012320222311001 |
5 | 332404002101324 |
6 | 14224534131225 |
7 | 1431431434544 |
oct | 250670526501 |
9 | 64444442368 |
10 | 22664097089 |
11 | 9680323657 |
12 | 44861b0b15 |
13 | 21a260064a |
14 | 115005085b |
15 | 8c9aad05e |
hex | 546e2ad41 |
22664097089 has 2 divisors, whose sum is σ = 22664097090. Its totient is φ = 22664097088.
The previous prime is 22664097061. The next prime is 22664097091. The reversal of 22664097089 is 98079046622.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19539287089 + 3124810000 = 139783^2 + 55900^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22664097089 is a prime.
It is a super-2 number, since 2×226640970892 (a number of 22 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 22664097091, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 22664097089.
It is not a weakly prime, because it can be changed into another prime (22664090089) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11332048544 + 11332048545.
It is an arithmetic number, because the mean of its divisors is an integer number (11332048545).
Almost surely, 222664097089 is an apocalyptic number.
It is an amenable number.
22664097089 is a deficient number, since it is larger than the sum of its proper divisors (1).
22664097089 is an equidigital number, since it uses as much as digits as its factorization.
22664097089 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2612736, while the sum is 53.
The spelling of 22664097089 in words is "twenty-two billion, six hundred sixty-four million, ninety-seven thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •