Base | Representation |
---|---|
bin | 1010000011110101101001… |
… | …01000100101011001001001 |
3 | 2220022212001000210101101002 |
4 | 11001322310220211121021 |
5 | 10344422041200042301 |
6 | 115014431421304345 |
7 | 4442161363243613 |
oct | 501726450453111 |
9 | 86285030711332 |
10 | 22122112112201 |
11 | 7059a31624112 |
12 | 25934b67050b5 |
13 | c4614c4a13aa |
14 | 566a04773db3 |
15 | 2856a847516b |
hex | 141eb4a25649 |
22122112112201 has 2 divisors, whose sum is σ = 22122112112202. Its totient is φ = 22122112112200.
The previous prime is 22122112112197. The next prime is 22122112112207. The reversal of 22122112112201 is 10221121122122.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 21784436064400 + 337676047801 = 4667380^2 + 581099^2 .
It is a cyclic number.
It is not a de Polignac number, because 22122112112201 - 22 = 22122112112197 is a prime.
It is a super-2 number, since 2×221221121122012 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (22122112112207) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11061056056100 + 11061056056101.
It is an arithmetic number, because the mean of its divisors is an integer number (11061056056101).
Almost surely, 222122112112201 is an apocalyptic number.
It is an amenable number.
22122112112201 is a deficient number, since it is larger than the sum of its proper divisors (1).
22122112112201 is an equidigital number, since it uses as much as digits as its factorization.
22122112112201 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 20.
Adding to 22122112112201 its reverse (10221121122122), we get a palindrome (32343233234323).
The spelling of 22122112112201 in words is "twenty-two trillion, one hundred twenty-two billion, one hundred twelve million, one hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •