Base | Representation |
---|---|
bin | 1001001001101000010110… |
… | …10010100100111110110001 |
3 | 2122020122200112020020202021 |
4 | 10210310023102210332301 |
5 | 10114140040431414301 |
6 | 110443545324551441 |
7 | 4144526450062552 |
oct | 444641322447661 |
9 | 78218615206667 |
10 | 20122111201201 |
11 | 6458815210939 |
12 | 230b9723b2581 |
13 | b2c6789ab489 |
14 | 4d7cb5b28329 |
15 | 24d6503678a1 |
hex | 124d0b4a4fb1 |
20122111201201 has 2 divisors, whose sum is σ = 20122111201202. Its totient is φ = 20122111201200.
The previous prime is 20122111201193. The next prime is 20122111201229. The reversal of 20122111201201 is 10210211122102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 20106480200625 + 15631000576 = 4484025^2 + 125024^2 .
It is a cyclic number.
It is not a de Polignac number, because 20122111201201 - 23 = 20122111201193 is a prime.
It is a super-2 number, since 2×201221112012012 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20122111202201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10061055600600 + 10061055600601.
It is an arithmetic number, because the mean of its divisors is an integer number (10061055600601).
Almost surely, 220122111201201 is an apocalyptic number.
It is an amenable number.
20122111201201 is a deficient number, since it is larger than the sum of its proper divisors (1).
20122111201201 is an equidigital number, since it uses as much as digits as its factorization.
20122111201201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 20122111201201 its reverse (10210211122102), we get a palindrome (30332322323303).
The spelling of 20122111201201 in words is "twenty trillion, one hundred twenty-two billion, one hundred eleven million, two hundred one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •