Base | Representation |
---|---|
bin | 11101010010111100001… |
… | …001000111100010010111 |
3 | 21010110102110020100201200 |
4 | 131102330021013202113 |
5 | 230441014001420203 |
6 | 4140504000323543 |
7 | 265310000602305 |
oct | 35227411074227 |
9 | 7113373210650 |
10 | 2013201201303 |
11 | 706880659806 |
12 | 2862090135b3 |
13 | 117ac85210a6 |
14 | 6d621c31275 |
15 | 3757be249a3 |
hex | 1d4bc247897 |
2013201201303 has 12 divisors (see below), whose sum is σ = 2912811985200. Its totient is φ = 1339893506016.
The previous prime is 2013201201239. The next prime is 2013201201367. The reversal of 2013201201303 is 3031021023102.
2013201201303 is a `hidden beast` number, since 20 + 1 + 320 + 1 + 20 + 1 + 303 = 666.
It is an interprime number because it is at equal distance from previous prime (2013201201239) and next prime (2013201201367).
It is not a de Polignac number, because 2013201201303 - 26 = 2013201201239 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2013201201203) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 186713326 + ... + 186724107.
It is an arithmetic number, because the mean of its divisors is an integer number (242734332100).
Almost surely, 22013201201303 is an apocalyptic number.
2013201201303 is a deficient number, since it is larger than the sum of its proper divisors (899610783897).
2013201201303 is a wasteful number, since it uses less digits than its factorization.
2013201201303 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 373438038 (or 373438035 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
Adding to 2013201201303 its reverse (3031021023102), we get a palindrome (5044222224405).
The spelling of 2013201201303 in words is "two trillion, thirteen billion, two hundred one million, two hundred one thousand, three hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •