Base | Representation |
---|---|
bin | 10010101111110101… |
… | …111001111101001011 |
3 | 1220221220011121120011 |
4 | 102233311321331023 |
5 | 312211240404003 |
6 | 13125252012351 |
7 | 1311561200362 |
oct | 225765717513 |
9 | 56856147504 |
10 | 20130013003 |
11 | 859a95a791 |
12 | 3a996010b7 |
13 | 1b8a5c92c9 |
14 | d8d68a7d9 |
15 | 7cc39d46d |
hex | 4afd79f4b |
20130013003 has 4 divisors (see below), whose sum is σ = 20558311200. Its totient is φ = 19701714808.
The previous prime is 20130012983. The next prime is 20130013009. The reversal of 20130013003 is 30031003102.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 30031003102 = 2 ⋅15015501551.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20130013003 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20130013009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 214149028 + ... + 214149121.
It is an arithmetic number, because the mean of its divisors is an integer number (5139577800).
Almost surely, 220130013003 is an apocalyptic number.
20130013003 is a deficient number, since it is larger than the sum of its proper divisors (428298197).
20130013003 is an equidigital number, since it uses as much as digits as its factorization.
20130013003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 428298196.
The product of its (nonzero) digits is 54, while the sum is 13.
Adding to 20130013003 its reverse (30031003102), we get a palindrome (50161016105).
Subtracting 20130013003 from its reverse (30031003102), we obtain a palindrome (9900990099).
The spelling of 20130013003 in words is "twenty billion, one hundred thirty million, thirteen thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •