Base | Representation |
---|---|
bin | 1001001100010010000001… |
… | …10010100110100100111010 |
3 | 2122120100210212201021012022 |
4 | 10212021000302212210322 |
5 | 10122133114443231020 |
6 | 110553452312314442 |
7 | 4154233005340442 |
oct | 446110062464472 |
9 | 78510725637168 |
10 | 20213203102010 |
11 | 649340a215196 |
12 | 23255549a2a22 |
13 | b38134aa6ab9 |
14 | 4dc477a57122 |
15 | 250bd24ca625 |
hex | 126240ca693a |
20213203102010 has 8 divisors (see below), whose sum is σ = 36383765583636. Its totient is φ = 8085281240800.
The previous prime is 20213203102007. The next prime is 20213203102013. The reversal of 20213203102010 is 1020130231202.
It is an interprime number because it is at equal distance from previous prime (20213203102007) and next prime (20213203102013).
It can be written as a sum of positive squares in 2 ways, for example, as 18552566238361 + 1660636863649 = 4307269^2 + 1288657^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a self number, because there is not a number n which added to its sum of digits gives 20213203102010.
It is not an unprimeable number, because it can be changed into a prime (20213203102013) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1010660155091 + ... + 1010660155110.
Almost surely, 220213203102010 is an apocalyptic number.
20213203102010 is a deficient number, since it is larger than the sum of its proper divisors (16170562481626).
20213203102010 is a wasteful number, since it uses less digits than its factorization.
20213203102010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2021320310208.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 20213203102010 its reverse (1020130231202), we get a palindrome (21233333333212).
The spelling of 20213203102010 in words is "twenty trillion, two hundred thirteen billion, two hundred three million, one hundred two thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •