Base | Representation |
---|---|
bin | 10100100110100001… |
… | …110001000001111101 |
3 | 2010002122222112011111 |
4 | 110212201301001331 |
5 | 330301013103034 |
6 | 14055022322021 |
7 | 1412120200246 |
oct | 244641610175 |
9 | 63078875144 |
10 | 22121222269 |
11 | 9421942783 |
12 | 4354429311 |
13 | 2116cb6343 |
14 | 10dbcd7ccd |
15 | 8970c6364 |
hex | 52687107d |
22121222269 has 2 divisors, whose sum is σ = 22121222270. Its totient is φ = 22121222268.
The previous prime is 22121222267. The next prime is 22121222293. The reversal of 22121222269 is 96222212122.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 18120659769 + 4000562500 = 134613^2 + 63250^2 .
It is a cyclic number.
It is not a de Polignac number, because 22121222269 - 21 = 22121222267 is a prime.
It is a super-5 number, since 5×221212222695 (a number of 53 digits) contains 55555 as substring. Note that it is a super-d number also for d = 2.
Together with 22121222267, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 22121222269.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22121222267) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11060611134 + 11060611135.
It is an arithmetic number, because the mean of its divisors is an integer number (11060611135).
Almost surely, 222121222269 is an apocalyptic number.
It is an amenable number.
22121222269 is a deficient number, since it is larger than the sum of its proper divisors (1).
22121222269 is an equidigital number, since it uses as much as digits as its factorization.
22121222269 is an evil number, because the sum of its binary digits is even.
The product of its digits is 6912, while the sum is 31.
The spelling of 22121222269 in words is "twenty-two billion, one hundred twenty-one million, two hundred twenty-two thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •