Base | Representation |
---|---|
bin | 1011000111010111100110… |
… | …0110111010011100001101 |
3 | 1121021100002222200022021001 |
4 | 2301311321212322130031 |
5 | 3100213030340413401 |
6 | 41554204005340301 |
7 | 2400645164465644 |
oct | 261657146723415 |
9 | 47240088608231 |
10 | 12221222201101 |
11 | 3991a9a364881 |
12 | 145467a707691 |
13 | 6a85c16820b4 |
14 | 30372041435b |
15 | 162d7e584601 |
hex | b1d799ba70d |
12221222201101 has 2 divisors, whose sum is σ = 12221222201102. Its totient is φ = 12221222201100.
The previous prime is 12221222201093. The next prime is 12221222201143. The reversal of 12221222201101 is 10110222212221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9297895070025 + 2923327131076 = 3049245^2 + 1709774^2 .
It is a cyclic number.
It is not a de Polignac number, because 12221222201101 - 23 = 12221222201093 is a prime.
It is a super-2 number, since 2×122212222011012 (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 (12221222201171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6110611100550 + 6110611100551.
It is an arithmetic number, because the mean of its divisors is an integer number (6110611100551).
Almost surely, 212221222201101 is an apocalyptic number.
It is an amenable number.
12221222201101 is a deficient number, since it is larger than the sum of its proper divisors (1).
12221222201101 is an equidigital number, since it uses as much as digits as its factorization.
12221222201101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 12221222201101 its reverse (10110222212221), we get a palindrome (22331444413322).
The spelling of 12221222201101 in words is "twelve trillion, two hundred twenty-one billion, two hundred twenty-two million, two hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •