Base | Representation |
---|---|
bin | 11101010011000010101… |
… | …000100101010101011001 |
3 | 21010110201001011122122102 |
4 | 131103002220211111121 |
5 | 230441224342104423 |
6 | 4140522450533145 |
7 | 265312462412405 |
oct | 35230250452531 |
9 | 7113631148572 |
10 | 2013310113113 |
11 | 706927087872 |
12 | 2862395971b5 |
13 | 117b14c65050 |
14 | 6d6324a2105 |
15 | 37586789c28 |
hex | 1d4c2a25559 |
2013310113113 has 16 divisors (see below), whose sum is σ = 2183585865216. Its totient is φ = 1845281934720.
The previous prime is 2013310113109. The next prime is 2013310113131. The reversal of 2013310113113 is 3113110133102.
It is a cyclic number.
It is not a de Polignac number, because 2013310113113 - 22 = 2013310113109 is a prime.
It is a super-2 number, since 2×20133101131132 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2013310113163) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 60056 + ... + 2007542.
It is an arithmetic number, because the mean of its divisors is an integer number (136474116576).
Almost surely, 22013310113113 is an apocalyptic number.
It is an amenable number.
2013310113113 is a deficient number, since it is larger than the sum of its proper divisors (170275752103).
2013310113113 is a wasteful number, since it uses less digits than its factorization.
2013310113113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1948064.
The product of its (nonzero) digits is 162, while the sum is 20.
Adding to 2013310113113 its reverse (3113110133102), we get a palindrome (5126420246215).
The spelling of 2013310113113 in words is "two trillion, thirteen billion, three hundred ten million, one hundred thirteen thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •