Base | Representation |
---|---|
bin | 1001001000111111001010… |
… | …11110101101001110100101 |
3 | 2122011112121200212222010200 |
4 | 10210133211132231032211 |
5 | 10113304301003310041 |
6 | 110425451412141113 |
7 | 4143114534051333 |
oct | 444374536551645 |
9 | 78145550788120 |
10 | 20100002010021 |
11 | 644a3aa14630a |
12 | 2307622007799 |
13 | b2a56434832b |
14 | 4d6bb9682b53 |
15 | 24cca936b1b6 |
hex | 1247e57ad3a5 |
20100002010021 has 24 divisors (see below), whose sum is σ = 30929775776640. Its totient is φ = 12534393154176.
The previous prime is 20100002010017. The next prime is 20100002010059. The reversal of 20100002010021 is 12001020000102.
It is not a de Polignac number, because 20100002010021 - 22 = 20100002010017 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 20100002009985 and 20100002010012.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20100002010061) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 402958381 + ... + 403008258.
It is an arithmetic number, because the mean of its divisors is an integer number (1288740657360).
Almost surely, 220100002010021 is an apocalyptic number.
It is an amenable number.
20100002010021 is a deficient number, since it is larger than the sum of its proper divisors (10829773766619).
20100002010021 is a wasteful number, since it uses less digits than its factorization.
20100002010021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 805966825 (or 805966822 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 20100002010021 its reverse (12001020000102), we get a palindrome (32101022010123).
The spelling of 20100002010021 in words is "twenty trillion, one hundred billion, two million, ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •