Base | Representation |
---|---|
bin | 1010010010011001101111… |
… | …11000010000011101110101 |
3 | 2222002200201000210022110001 |
4 | 11021030313320100131311 |
5 | 10431121420220224141 |
6 | 120040351422431301 |
7 | 4523265250205644 |
oct | 511146770203565 |
9 | 88080630708401 |
10 | 22622530242421 |
11 | 723218560aa7a |
12 | 2654493732531 |
13 | c813ac13aaa5 |
14 | 582d1731b35b |
15 | 2936e5b4da31 |
hex | 149337e10775 |
22622530242421 has 2 divisors, whose sum is σ = 22622530242422. Its totient is φ = 22622530242420.
The previous prime is 22622530242419. The next prime is 22622530242439. The reversal of 22622530242421 is 12424203522622.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 18328459380625 + 4294070861796 = 4281175^2 + 2072214^2 .
It is a cyclic number.
It is not a de Polignac number, because 22622530242421 - 21 = 22622530242419 is a prime.
Together with 22622530242419, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22622530242121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11311265121210 + 11311265121211.
It is an arithmetic number, because the mean of its divisors is an integer number (11311265121211).
Almost surely, 222622530242421 is an apocalyptic number.
It is an amenable number.
22622530242421 is a deficient number, since it is larger than the sum of its proper divisors (1).
22622530242421 is an equidigital number, since it uses as much as digits as its factorization.
22622530242421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 184320, while the sum is 37.
The spelling of 22622530242421 in words is "twenty-two trillion, six hundred twenty-two billion, five hundred thirty million, two hundred forty-two thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •