Base | Representation |
---|---|
bin | 1001100110101110110010… |
… | …11100000010101000110101 |
3 | 2202210020120122112220021001 |
4 | 10303113121130002220311 |
5 | 10232030330030414031 |
6 | 112531151443123301 |
7 | 4310004622253302 |
oct | 463273134025065 |
9 | 82706518486231 |
10 | 21122002201141 |
11 | 6803877658436 |
12 | 2451703973531 |
13 | ba2a47501b2a |
14 | 53044b8ba0a9 |
15 | 26967224c861 |
hex | 1335d9702a35 |
21122002201141 has 2 divisors, whose sum is σ = 21122002201142. Its totient is φ = 21122002201140.
The previous prime is 21122002201117. The next prime is 21122002201151. The reversal of 21122002201141 is 14110220022112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11710912138641 + 9411090062500 = 3422121^2 + 3067750^2 .
It is a cyclic number.
It is not a de Polignac number, because 21122002201141 - 25 = 21122002201109 is a prime.
It is a super-2 number, since 2×211220022011412 (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 (21122002201151) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10561001100570 + 10561001100571.
It is an arithmetic number, because the mean of its divisors is an integer number (10561001100571).
Almost surely, 221122002201141 is an apocalyptic number.
It is an amenable number.
21122002201141 is a deficient number, since it is larger than the sum of its proper divisors (1).
21122002201141 is an equidigital number, since it uses as much as digits as its factorization.
21122002201141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 21122002201141 its reverse (14110220022112), we get a palindrome (35232222223253).
The spelling of 21122002201141 in words is "twenty-one trillion, one hundred twenty-two billion, two million, two hundred one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •