Base | Representation |
---|---|
bin | 11101010010110000001… |
… | …001101011000000110101 |
3 | 21010102220102200021220002 |
4 | 131102300021223000311 |
5 | 230440111001120041 |
6 | 4140432012321045 |
7 | 265302005565044 |
oct | 35226011530065 |
9 | 7112812607802 |
10 | 2013000020021 |
11 | 70678803a291 |
12 | 286171773185 |
13 | 117a95942203 |
14 | 6d60322255b |
15 | 3756943559b |
hex | 1d4b026b035 |
2013000020021 has 4 divisors (see below), whose sum is σ = 2013160930944. Its totient is φ = 2012839109100.
The previous prime is 2013000019991. The next prime is 2013000020033. The reversal of 2013000020021 is 1200200003102.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2013000020021 - 26 = 2013000019957 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2013000019984 and 2013000020011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2013000020051) 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, 80436695 + ... + 80461716.
It is an arithmetic number, because the mean of its divisors is an integer number (503290232736).
Almost surely, 22013000020021 is an apocalyptic number.
It is an amenable number.
2013000020021 is a deficient number, since it is larger than the sum of its proper divisors (160910923).
2013000020021 is a wasteful number, since it uses less digits than its factorization.
2013000020021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 160910922.
The product of its (nonzero) digits is 24, while the sum is 11.
Adding to 2013000020021 its reverse (1200200003102), we get a palindrome (3213200023123).
The spelling of 2013000020021 in words is "two trillion, thirteen billion, twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •