Base | Representation |
---|---|
bin | 10010101000110011… |
… | …101111010000111101 |
3 | 1220122200010011012122 |
4 | 102220303233100331 |
5 | 311441033120123 |
6 | 13105434412325 |
7 | 1305626142122 |
oct | 225063572075 |
9 | 56580104178 |
10 | 20012004413 |
11 | 853a289125 |
12 | 3a65b910a5 |
13 | 1b6c01b93b |
14 | d7bb2c749 |
15 | 7c1d3cbc8 |
hex | 4a8cef43d |
20012004413 has 4 divisors (see below), whose sum is σ = 20024679840. Its totient is φ = 19999328988.
The previous prime is 20012004409. The next prime is 20012004433. The reversal of 20012004413 is 31440021002.
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 20012004413 - 22 = 20012004409 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20012004391 and 20012004400.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20012004403) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6335345 + ... + 6338502.
It is an arithmetic number, because the mean of its divisors is an integer number (5006169960).
Almost surely, 220012004413 is an apocalyptic number.
It is an amenable number.
20012004413 is a deficient number, since it is larger than the sum of its proper divisors (12675427).
20012004413 is a wasteful number, since it uses less digits than its factorization.
20012004413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12675426.
The product of its (nonzero) digits is 192, while the sum is 17.
Adding to 20012004413 its reverse (31440021002), we get a palindrome (51452025415).
The spelling of 20012004413 in words is "twenty billion, twelve million, four thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •