Base | Representation |
---|---|
bin | 10010101000100000… |
… | …110011010000001101 |
3 | 1220122022202221022222 |
4 | 102220200303100031 |
5 | 311433300240023 |
6 | 13105140145125 |
7 | 1305536014502 |
oct | 225040632015 |
9 | 56568687288 |
10 | 20007040013 |
11 | 85374a8314 |
12 | 3a643981a5 |
13 | 1b6aca111c |
14 | d7b1d94a9 |
15 | 7c16abcc8 |
hex | 4a883340d |
20007040013 has 4 divisors (see below), whose sum is σ = 20384531388. Its totient is φ = 19629548640.
The previous prime is 20007040003. The next prime is 20007040049. The reversal of 20007040013 is 31004070002.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 14301050569 + 5705989444 = 119587^2 + 75538^2 .
It is a cyclic number.
It is not a de Polignac number, because 20007040013 - 28 = 20007039757 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20007039973 and 20007040000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20007040003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 188745608 + ... + 188745713.
It is an arithmetic number, because the mean of its divisors is an integer number (5096132847).
Almost surely, 220007040013 is an apocalyptic number.
It is an amenable number.
20007040013 is a deficient number, since it is larger than the sum of its proper divisors (377491375).
20007040013 is an equidigital number, since it uses as much as digits as its factorization.
20007040013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 377491374.
The product of its (nonzero) digits is 168, while the sum is 17.
The spelling of 20007040013 in words is "twenty billion, seven million, forty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •