Base | Representation |
---|---|
bin | 1001001001000011010011… |
… | …10011101011011000100001 |
3 | 2122011202100102101020001111 |
4 | 10210201221303223120201 |
5 | 10113323322324200001 |
6 | 110430500000303321 |
7 | 4143223542363016 |
oct | 444415163533041 |
9 | 78152312336044 |
10 | 20102222100001 |
11 | 6450339347818 |
12 | 2307b41611b41 |
13 | b2a829292042 |
14 | 4d6d4a46d70d |
15 | 24cd89205851 |
hex | 124869ceb621 |
20102222100001 has 2 divisors, whose sum is σ = 20102222100002. Its totient is φ = 20102222100000.
The previous prime is 20102222099951. The next prime is 20102222100007. The reversal of 20102222100001 is 10000122220102.
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., 16437964749376 + 3664257350625 = 4054376^2 + 1914225^2 .
It is a cyclic number.
It is not a de Polignac number, because 20102222100001 - 219 = 20102221575713 is a prime.
It is a super-2 number, since 2×201022221000012 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20102222100007) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10051111050000 + 10051111050001.
It is an arithmetic number, because the mean of its divisors is an integer number (10051111050001).
Almost surely, 220102222100001 is an apocalyptic number.
It is an amenable number.
20102222100001 is a deficient number, since it is larger than the sum of its proper divisors (1).
20102222100001 is an equidigital number, since it uses as much as digits as its factorization.
20102222100001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 20102222100001 its reverse (10000122220102), we get a palindrome (30102344320103).
The spelling of 20102222100001 in words is "twenty trillion, one hundred two billion, two hundred twenty-two million, one hundred thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •