Base | Representation |
---|---|
bin | 1010001100001110000110… |
… | …10001001011100011011001 |
3 | 2221100101102211021120000101 |
4 | 11012013003101023203121 |
5 | 10414131411313202441 |
6 | 115355022303335401 |
7 | 4502035450543654 |
oct | 506070321134331 |
9 | 87311384246011 |
10 | 22410120444121 |
11 | 716009583a723 |
12 | 261b293bb1561 |
13 | c6735aac49c7 |
14 | 57692702689b |
15 | 28ce12eac231 |
hex | 1461c344b8d9 |
22410120444121 has 2 divisors, whose sum is σ = 22410120444122. Its totient is φ = 22410120444120.
The previous prime is 22410120444083. The next prime is 22410120444137. The reversal of 22410120444121 is 12144402101422.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17217810819225 + 5192309624896 = 4149435^2 + 2278664^2 .
It is a cyclic number.
It is not a de Polignac number, because 22410120444121 - 221 = 22410118346969 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 22410120444121.
It is not a weakly prime, because it can be changed into another prime (22410120444161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11205060222060 + 11205060222061.
It is an arithmetic number, because the mean of its divisors is an integer number (11205060222061).
Almost surely, 222410120444121 is an apocalyptic number.
It is an amenable number.
22410120444121 is a deficient number, since it is larger than the sum of its proper divisors (1).
22410120444121 is an equidigital number, since it uses as much as digits as its factorization.
22410120444121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4096, while the sum is 28.
Adding to 22410120444121 its reverse (12144402101422), we get a palindrome (34554522545543).
The spelling of 22410120444121 in words is "twenty-two trillion, four hundred ten billion, one hundred twenty million, four hundred forty-four thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •