Base | Representation |
---|---|
bin | 1010000100011100110101… |
… | …01101011001110110111101 |
3 | 2220101212100100001122201221 |
4 | 11002032122231121312331 |
5 | 10400243133403121131 |
6 | 115032231255233341 |
7 | 4443534643340611 |
oct | 502163255316675 |
9 | 86355310048657 |
10 | 22143152004541 |
11 | 7067949043697 |
12 | 25975a8978851 |
13 | c48123442a29 |
14 | 567a3cbcd341 |
15 | 285eda652411 |
hex | 14239ab59dbd |
22143152004541 has 2 divisors, whose sum is σ = 22143152004542. Its totient is φ = 22143152004540.
The previous prime is 22143152004469. The next prime is 22143152004557. The reversal of 22143152004541 is 14540025134122.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11882181278916 + 10260970725625 = 3447054^2 + 3203275^2 .
It is a cyclic number.
It is not a de Polignac number, because 22143152004541 - 211 = 22143152002493 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22143152004497 and 22143152004506.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (22143152004241) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11071576002270 + 11071576002271.
It is an arithmetic number, because the mean of its divisors is an integer number (11071576002271).
Almost surely, 222143152004541 is an apocalyptic number.
It is an amenable number.
22143152004541 is a deficient number, since it is larger than the sum of its proper divisors (1).
22143152004541 is an equidigital number, since it uses as much as digits as its factorization.
22143152004541 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 38400, while the sum is 34.
Adding to 22143152004541 its reverse (14540025134122), we get a palindrome (36683177138663).
The spelling of 22143152004541 in words is "twenty-two trillion, one hundred forty-three billion, one hundred fifty-two million, four thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •