Base | Representation |
---|---|
bin | 1010000110101110100110… |
… | …11011110111110100110011 |
3 | 2220200100100111011022102001 |
4 | 11003113103123313310303 |
5 | 10403033423224340311 |
6 | 115132213134434431 |
7 | 4452305222013064 |
oct | 503272333676463 |
9 | 86610314138361 |
10 | 22221413121331 |
11 | 709805943a006 |
12 | 25aa7aa362a17 |
13 | c52616235b68 |
14 | 56b744a4056b |
15 | 28806b13b4c1 |
hex | 1435d36f7d33 |
22221413121331 has 2 divisors, whose sum is σ = 22221413121332. Its totient is φ = 22221413121330.
The previous prime is 22221413121239. The next prime is 22221413121337. The reversal of 22221413121331 is 13312131412222.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-22221413121331 is a prime.
It is a super-2 number, since 2×222214131213312 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 22221413121331.
It is not a weakly prime, because it can be changed into another prime (22221413121337) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11110706560665 + 11110706560666.
It is an arithmetic number, because the mean of its divisors is an integer number (11110706560666).
Almost surely, 222221413121331 is an apocalyptic number.
22221413121331 is a deficient number, since it is larger than the sum of its proper divisors (1).
22221413121331 is an equidigital number, since it uses as much as digits as its factorization.
22221413121331 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3456, while the sum is 28.
Adding to 22221413121331 its reverse (13312131412222), we get a palindrome (35533544533553).
The spelling of 22221413121331 in words is "twenty-two trillion, two hundred twenty-one billion, four hundred thirteen million, one hundred twenty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •