Base | Representation |
---|---|
bin | 10100100110101101… |
… | …001100111110110101 |
3 | 2010002212121211202012 |
4 | 110212231030332311 |
5 | 330302300022331 |
6 | 14055210454005 |
7 | 1412154525056 |
oct | 244655147665 |
9 | 63085554665 |
10 | 22124220341 |
11 | 9423600223 |
12 | 4355434305 |
13 | 21177c5b52 |
14 | 10dc47872d |
15 | 8974b982b |
hex | 526b4cfb5 |
22124220341 has 2 divisors, whose sum is σ = 22124220342. Its totient is φ = 22124220340.
The previous prime is 22124220323. The next prime is 22124220343. The reversal of 22124220341 is 14302242122.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13889565316 + 8234655025 = 117854^2 + 90745^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22124220341 is a prime.
It is a super-2 number, since 2×221242203412 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 22124220343, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22124220343) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11062110170 + 11062110171.
It is an arithmetic number, because the mean of its divisors is an integer number (11062110171).
Almost surely, 222124220341 is an apocalyptic number.
It is an amenable number.
22124220341 is a deficient number, since it is larger than the sum of its proper divisors (1).
22124220341 is an equidigital number, since it uses as much as digits as its factorization.
22124220341 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1536, while the sum is 23.
Adding to 22124220341 its reverse (14302242122), we get a palindrome (36426462463).
The spelling of 22124220341 in words is "twenty-two billion, one hundred twenty-four million, two hundred twenty thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •