Base | Representation |
---|---|
bin | 1001001001101000001001… |
… | …01110001100011100001001 |
3 | 2122020122101211212110101202 |
4 | 10210310010232030130021 |
5 | 10114134324224001301 |
6 | 110443530350553545 |
7 | 4144523641303052 |
oct | 444640456143411 |
9 | 78218354773352 |
10 | 20122001000201 |
11 | 6458768a92231 |
12 | 230b9415088b5 |
13 | b2c65bc05799 |
14 | 4d7ca523d729 |
15 | 24d64584a66b |
hex | 124d04b8c709 |
20122001000201 has 2 divisors, whose sum is σ = 20122001000202. Its totient is φ = 20122001000200.
The previous prime is 20122001000191. The next prime is 20122001000209. The reversal of 20122001000201 is 10200010022102.
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., 19682665345225 + 439335654976 = 4436515^2 + 662824^2 .
It is a cyclic number.
It is not a de Polignac number, because 20122001000201 - 218 = 20122000738057 is a prime.
It is a super-3 number, since 3×201220010002013 (a number of 41 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (20122001000209) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10061000500100 + 10061000500101.
It is an arithmetic number, because the mean of its divisors is an integer number (10061000500101).
Almost surely, 220122001000201 is an apocalyptic number.
It is an amenable number.
20122001000201 is a deficient number, since it is larger than the sum of its proper divisors (1).
20122001000201 is an equidigital number, since it uses as much as digits as its factorization.
20122001000201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16, while the sum is 11.
Adding to 20122001000201 its reverse (10200010022102), we get a palindrome (30322011022303).
The spelling of 20122001000201 in words is "twenty trillion, one hundred twenty-two billion, one million, two hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •