Base | Representation |
---|---|
bin | 1001000110001000101001… |
… | …01101100111100010011101 |
3 | 2121211011200111000020221210 |
4 | 10203010110231213202131 |
5 | 10110203104102401341 |
6 | 110312444023415033 |
7 | 4133045313315630 |
oct | 443042455474235 |
9 | 77734614006853 |
10 | 20002010200221 |
11 | 6411894341235 |
12 | 22b06348b4479 |
13 | b212488bcb1a |
14 | 4d216120dc17 |
15 | 24a4715b0c16 |
hex | 123114b6789d |
20002010200221 has 64 divisors (see below), whose sum is σ = 33661299507200. Its totient is φ = 10307075558400.
The previous prime is 20002010200201. The next prime is 20002010200273. The reversal of 20002010200221 is 12200201020002.
It is not a de Polignac number, because 20002010200221 - 213 = 20002010192029 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20002010200197 and 20002010200206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20002010200201) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 12500476 + ... + 14009493.
It is an arithmetic number, because the mean of its divisors is an integer number (525957804800).
Almost surely, 220002010200221 is an apocalyptic number.
20002010200221 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
20002010200221 is a deficient number, since it is larger than the sum of its proper divisors (13659289306979).
20002010200221 is a wasteful number, since it uses less digits than its factorization.
20002010200221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26510090.
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 20002010200221 its reverse (12200201020002), we get a palindrome (32202211220223).
The spelling of 20002010200221 in words is "twenty trillion, two billion, ten million, two hundred thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •