Base | Representation |
---|---|
bin | 1001001001000011010000… |
… | …11111011101000000011101 |
3 | 2122011202021212211111101111 |
4 | 10210201220133131000131 |
5 | 10113323301201133041 |
6 | 110430453451142021 |
7 | 4143223153614556 |
oct | 444415037350035 |
9 | 78152255744344 |
10 | 20102200021021 |
11 | 6450327937528 |
12 | 2307b36144911 |
13 | b2a824831561 |
14 | 4d6d4756332d |
15 | 24cd872e3981 |
hex | 1248687dd01d |
20102200021021 has 2 divisors, whose sum is σ = 20102200021022. Its totient is φ = 20102200021020.
The previous prime is 20102200020977. The next prime is 20102200021093. The reversal of 20102200021021 is 12012000220102.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 17639042412996 + 2463157608025 = 4199886^2 + 1569445^2 .
It is a cyclic number.
It is not a de Polignac number, because 20102200021021 - 221 = 20102197923869 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20102200020992 and 20102200021010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20102200001021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10051100010510 + 10051100010511.
It is an arithmetic number, because the mean of its divisors is an integer number (10051100010511).
Almost surely, 220102200021021 is an apocalyptic number.
It is an amenable number.
20102200021021 is a deficient number, since it is larger than the sum of its proper divisors (1).
20102200021021 is an equidigital number, since it uses as much as digits as its factorization.
20102200021021 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 20102200021021 its reverse (12012000220102), we get a palindrome (32114200241123).
The spelling of 20102200021021 in words is "twenty trillion, one hundred two billion, two hundred million, twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •