Base | Representation |
---|---|
bin | 1010000100011010101110… |
… | …01111111100111100001001 |
3 | 2220101202102110101120002221 |
4 | 11002031113033330330021 |
5 | 10400233324133213231 |
6 | 115031523105054041 |
7 | 4443464621264425 |
oct | 502152717747411 |
9 | 86352373346087 |
10 | 22142020210441 |
11 | 7067418192a6a |
12 | 2597331927321 |
13 | c47ca2b0c591 |
14 | 567972775b85 |
15 | 285e710dad11 |
hex | 1423573fcf09 |
22142020210441 has 2 divisors, whose sum is σ = 22142020210442. Its totient is φ = 22142020210440.
The previous prime is 22142020210417. The next prime is 22142020210451. The reversal of 22142020210441 is 14401202024122.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 21747672633600 + 394347576841 = 4663440^2 + 627971^2 .
It is a cyclic number.
It is not a de Polignac number, because 22142020210441 - 29 = 22142020209929 is a prime.
It is a super-3 number, since 3×221420202104413 (a number of 41 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (22142020210451) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11071010105220 + 11071010105221.
It is an arithmetic number, because the mean of its divisors is an integer number (11071010105221).
Almost surely, 222142020210441 is an apocalyptic number.
It is an amenable number.
22142020210441 is a deficient number, since it is larger than the sum of its proper divisors (1).
22142020210441 is an equidigital number, since it uses as much as digits as its factorization.
22142020210441 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2048, while the sum is 25.
Adding to 22142020210441 its reverse (14401202024122), we get a palindrome (36543222234563).
The spelling of 22142020210441 in words is "twenty-two trillion, one hundred forty-two billion, twenty million, two hundred ten thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •