Base | Representation |
---|---|
bin | 1001001001000001011010… |
… | …00000110001010111011001 |
3 | 2122011122201100002222112221 |
4 | 10210200231000301113121 |
5 | 10113314230220402301 |
6 | 110430210442504041 |
7 | 4143156345614554 |
oct | 444405500612731 |
9 | 78148640088487 |
10 | 20101202122201 |
11 | 644a965619362 |
12 | 23078b7b05021 |
13 | b2a6c5b7b895 |
14 | 4d6c90c0169b |
15 | 24cd298c9da1 |
hex | 12482d0315d9 |
20101202122201 has 2 divisors, whose sum is σ = 20101202122202. Its totient is φ = 20101202122200.
The previous prime is 20101202122159. The next prime is 20101202122231. The reversal of 20101202122201 is 10222120210102.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18437233699600 + 1663968422601 = 4293860^2 + 1289949^2 .
It is a cyclic number.
It is not a de Polignac number, because 20101202122201 - 237 = 19963763168729 is a prime.
It is a super-2 number, since 2×201012021222012 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20101202122231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10050601061100 + 10050601061101.
It is an arithmetic number, because the mean of its divisors is an integer number (10050601061101).
Almost surely, 220101202122201 is an apocalyptic number.
It is an amenable number.
20101202122201 is a deficient number, since it is larger than the sum of its proper divisors (1).
20101202122201 is an equidigital number, since it uses as much as digits as its factorization.
20101202122201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 20101202122201 its reverse (10222120210102), we get a palindrome (30323322332303).
The spelling of 20101202122201 in words is "twenty trillion, one hundred one billion, two hundred two million, one hundred twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •