Base | Representation |
---|---|
bin | 10010101001010110… |
… | …000110101000010101 |
3 | 1220200022001211200111 |
4 | 102221112012220111 |
5 | 312000334404023 |
6 | 13110355443021 |
7 | 1306065542221 |
oct | 225126065025 |
9 | 56608054614 |
10 | 20021013013 |
11 | 8544381451 |
12 | 3a68bb6471 |
13 | 1b70b54181 |
14 | d7cdd5781 |
15 | 7c2a1c00d |
hex | 4a9586a15 |
20021013013 has 4 divisors (see below), whose sum is σ = 21074750560. Its totient is φ = 18967275468.
The previous prime is 20021012993. The next prime is 20021013017. The reversal of 20021013013 is 31031012002.
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 20021013013 - 25 = 20021012981 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20021012984 and 20021013002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20021013017) 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, 526868745 + ... + 526868782.
It is an arithmetic number, because the mean of its divisors is an integer number (5268687640).
Almost surely, 220021013013 is an apocalyptic number.
It is an amenable number.
20021013013 is a deficient number, since it is larger than the sum of its proper divisors (1053737547).
20021013013 is a wasteful number, since it uses less digits than its factorization.
20021013013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1053737546.
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 20021013013 its reverse (31031012002), we get a palindrome (51052025015).
The spelling of 20021013013 in words is "twenty billion, twenty-one million, thirteen thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •