Base | Representation |
---|---|
bin | 10100111101101000… |
… | …101001101011100101 |
3 | 2011002200110202100022 |
4 | 110331220221223211 |
5 | 332044234400031 |
6 | 14201311524525 |
7 | 1424535343214 |
oct | 247550515345 |
9 | 64080422308 |
10 | 22508903141 |
11 | 960076409a |
12 | 4442229745 |
13 | 21794035ca |
14 | 11375b307b |
15 | 8bb15497b |
hex | 53da29ae5 |
22508903141 has 2 divisors, whose sum is σ = 22508903142. Its totient is φ = 22508903140.
The previous prime is 22508903111. The next prime is 22508903143. The reversal of 22508903141 is 14130980522.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19753178116 + 2755725025 = 140546^2 + 52495^2 .
It is a cyclic number.
It is not a de Polignac number, because 22508903141 - 26 = 22508903077 is a prime.
It is a super-2 number, since 2×225089031412 (a number of 22 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 22508903143, 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 (22508903143) 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, 11254451570 + 11254451571.
It is an arithmetic number, because the mean of its divisors is an integer number (11254451571).
Almost surely, 222508903141 is an apocalyptic number.
It is an amenable number.
22508903141 is a deficient number, since it is larger than the sum of its proper divisors (1).
22508903141 is an equidigital number, since it uses as much as digits as its factorization.
22508903141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17280, while the sum is 35.
The spelling of 22508903141 in words is "twenty-two billion, five hundred eight million, nine hundred three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •