Base | Representation |
---|---|
bin | 111011111111101… |
… | …1010011111101111 |
3 | 12012022000200220221 |
4 | 1313333122133233 |
5 | 13110324043203 |
6 | 531431552211 |
7 | 100613113036 |
oct | 16777323757 |
9 | 5168020827 |
10 | 2013112303 |
11 | 943393084 |
12 | 48222b667 |
13 | 2610b8717 |
14 | 15150d71d |
15 | bbb02abd |
hex | 77fda7ef |
2013112303 has 4 divisors (see below), whose sum is σ = 2051095608. Its totient is φ = 1975129000.
The previous prime is 2013112291. The next prime is 2013112337. The reversal of 2013112303 is 3032113102.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 3032113102 = 2 ⋅1516056551.
It is a cyclic number.
It is not a de Polignac number, because 2013112303 - 29 = 2013111791 is a prime.
It is a super-2 number, since 2×20131123032 = 8105242288979927618, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2013112373) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18991573 + ... + 18991678.
It is an arithmetic number, because the mean of its divisors is an integer number (512773902).
Almost surely, 22013112303 is an apocalyptic number.
2013112303 is a deficient number, since it is larger than the sum of its proper divisors (37983305).
2013112303 is an equidigital number, since it uses as much as digits as its factorization.
2013112303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 37983304.
The product of its (nonzero) digits is 108, while the sum is 16.
The square root of 2013112303 is about 44867.7200557372. The cubic root of 2013112303 is about 1262.6684655499.
Adding to 2013112303 its reverse (3032113102), we get a palindrome (5045225405).
The spelling of 2013112303 in words is "two billion, thirteen million, one hundred twelve thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •