Base | Representation |
---|---|
bin | 10100110001010100… |
… | …100001101111000001 |
3 | 2010120021201021122122 |
4 | 110301110201233001 |
5 | 331133342113441 |
6 | 14125011414025 |
7 | 1416446301032 |
oct | 246124415701 |
9 | 63507637578 |
10 | 22302301121 |
11 | 9505081a21 |
12 | 43a4bb4315 |
13 | 21456772a9 |
14 | 1117d92a89 |
15 | 8a7e4434b |
hex | 531521bc1 |
22302301121 has 2 divisors, whose sum is σ = 22302301122. Its totient is φ = 22302301120.
The previous prime is 22302301081. The next prime is 22302301159. The reversal of 22302301121 is 12110320322.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 22293774721 + 8526400 = 149311^2 + 2920^2 .
It is a cyclic number.
It is not a de Polignac number, because 22302301121 - 26 = 22302301057 is a prime.
It is a super-4 number, since 4×223023011214 (a number of 42 digits) contains 4444 as substring.
It is a Sophie Germain 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 22302301121.
It is not a weakly prime, because it can be changed into another prime (22302351121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11151150560 + 11151150561.
It is an arithmetic number, because the mean of its divisors is an integer number (11151150561).
Almost surely, 222302301121 is an apocalyptic number.
It is an amenable number.
22302301121 is a deficient number, since it is larger than the sum of its proper divisors (1).
22302301121 is an equidigital number, since it uses as much as digits as its factorization.
22302301121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 22302301121 its reverse (12110320322), we get a palindrome (34412621443).
The spelling of 22302301121 in words is "twenty-two billion, three hundred two million, three hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •