Base | Representation |
---|---|
bin | 1010001100100010011011… |
… | …01110011011000010100011 |
3 | 2221101102121100202002011121 |
4 | 11012101031232123002203 |
5 | 10414321234011101011 |
6 | 115404025215553111 |
7 | 4502603051360464 |
oct | 506211556330243 |
9 | 87342540662147 |
10 | 22421033300131 |
11 | 7164785867994 |
12 | 262141a82b797 |
13 | c683a995a35b |
14 | 5772804d0d6b |
15 | 28d351085e71 |
hex | 14644db9b0a3 |
22421033300131 has 2 divisors, whose sum is σ = 22421033300132. Its totient is φ = 22421033300130.
The previous prime is 22421033300129. The next prime is 22421033300179. The reversal of 22421033300131 is 13100333012422.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 22421033300131 - 21 = 22421033300129 is a prime.
It is a super-2 number, since 2×224210333001312 (a number of 28 digits) contains 22 as substring.
Together with 22421033300129, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 22421033300096 and 22421033300105.
It is not a weakly prime, because it can be changed into another prime (22421033300231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11210516650065 + 11210516650066.
It is an arithmetic number, because the mean of its divisors is an integer number (11210516650066).
Almost surely, 222421033300131 is an apocalyptic number.
22421033300131 is a deficient number, since it is larger than the sum of its proper divisors (1).
22421033300131 is an equidigital number, since it uses as much as digits as its factorization.
22421033300131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 22421033300131 its reverse (13100333012422), we get a palindrome (35521366312553).
The spelling of 22421033300131 in words is "twenty-two trillion, four hundred twenty-one billion, thirty-three million, three hundred thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •