Base | Representation |
---|---|
bin | 10010101111110101… |
… | …110111100100001101 |
3 | 1220221220011010010120 |
4 | 102233311313210031 |
5 | 312211240100323 |
6 | 13125251455153 |
7 | 1311561130005 |
oct | 225765674415 |
9 | 56856133116 |
10 | 20130003213 |
11 | 859a9533a1 |
12 | 3a995b74b9 |
13 | 1b8a5c4a08 |
14 | d8d687005 |
15 | 7cc39a5e3 |
hex | 4afd7790d |
20130003213 has 32 divisors (see below), whose sum is σ = 28248729600. Its totient is φ = 12725989056.
The previous prime is 20130003211. The next prime is 20130003239. The reversal of 20130003213 is 31230003102.
It is not a de Polignac number, because 20130003213 - 21 = 20130003211 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20130003192 and 20130003201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20130003211) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 10712208 + ... + 10714086.
It is an arithmetic number, because the mean of its divisors is an integer number (882772800).
Almost surely, 220130003213 is an apocalyptic number.
20130003213 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
20130003213 is a deficient number, since it is larger than the sum of its proper divisors (8118726387).
20130003213 is a wasteful number, since it uses less digits than its factorization.
20130003213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3161.
The product of its (nonzero) digits is 108, while the sum is 15.
Adding to 20130003213 its reverse (31230003102), we get a palindrome (51360006315).
The spelling of 20130003213 in words is "twenty billion, one hundred thirty million, three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •