Base | Representation |
---|---|
bin | 10010101000111010… |
… | …000100001110001011 |
3 | 1220122210020102112001 |
4 | 102220322010032023 |
5 | 311441444204430 |
6 | 13105534131431 |
7 | 1305646221025 |
oct | 225072041613 |
9 | 56583212461 |
10 | 20013663115 |
11 | 8540211356 |
12 | 3a66650b77 |
13 | 1b6c47c914 |
14 | d7c041015 |
15 | 7c20693ca |
hex | 4a8e8438b |
20013663115 has 4 divisors (see below), whose sum is σ = 24016395744. Its totient is φ = 16010930488.
The previous prime is 20013663071. The next prime is 20013663133. The reversal of 20013663115 is 51136631002.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20013663115 - 27 = 20013662987 is a prime.
It is a super-2 number, since 2×200136631152 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2001366307 + ... + 2001366316.
It is an arithmetic number, because the mean of its divisors is an integer number (6004098936).
Almost surely, 220013663115 is an apocalyptic number.
20013663115 is a deficient number, since it is larger than the sum of its proper divisors (4002732629).
20013663115 is an equidigital number, since it uses as much as digits as its factorization.
20013663115 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4002732628.
The product of its (nonzero) digits is 3240, while the sum is 28.
The spelling of 20013663115 in words is "twenty billion, thirteen million, six hundred sixty-three thousand, one hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •