Base | Representation |
---|---|
bin | 1011000110110001111011… |
… | …1100001000001111101101 |
3 | 1121020101000022212020000201 |
4 | 2301230132330020033231 |
5 | 3100031323420221141 |
6 | 41545412413353501 |
7 | 2400136500532141 |
oct | 261543674101755 |
9 | 47211008766021 |
10 | 12211111101421 |
11 | 3988780967a51 |
12 | 1452718498891 |
13 | 6a766c965b8b |
14 | 303041611221 |
15 | 16298ba7d031 |
hex | b1b1ef083ed |
12211111101421 has 2 divisors, whose sum is σ = 12211111101422. Its totient is φ = 12211111101420.
The previous prime is 12211111101349. The next prime is 12211111101437. The reversal of 12211111101421 is 12410111111221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 12170120644900 + 40990456521 = 3488570^2 + 202461^2 .
It is a cyclic number.
It is not a de Polignac number, because 12211111101421 - 225 = 12211077546989 is a prime.
It is a super-2 number, since 2×122111111014212 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12211111101461) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6105555550710 + 6105555550711.
It is an arithmetic number, because the mean of its divisors is an integer number (6105555550711).
Almost surely, 212211111101421 is an apocalyptic number.
It is an amenable number.
12211111101421 is a deficient number, since it is larger than the sum of its proper divisors (1).
12211111101421 is an equidigital number, since it uses as much as digits as its factorization.
12211111101421 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 19.
Adding to 12211111101421 its reverse (12410111111221), we get a palindrome (24621222212642).
The spelling of 12211111101421 in words is "twelve trillion, two hundred eleven billion, one hundred eleven million, one hundred one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •