Base | Representation |
---|---|
bin | 11101010010111101010… |
… | …001100110101001111011 |
3 | 21010110110202222202100002 |
4 | 131102331101212221323 |
5 | 230441033333000011 |
6 | 4140505515503215 |
7 | 265310321243234 |
oct | 35227521465173 |
9 | 7113422882302 |
10 | 2013220203131 |
11 | 7068903580a5 |
12 | 286213457b0b |
13 | 117acc445087 |
14 | 6d62457a08b |
15 | 3757d929c3b |
hex | 1d4bd466a7b |
2013220203131 has 6 divisors (see below), whose sum is σ = 2041176353220. Its totient is φ = 1985641838928.
The previous prime is 2013220203119. The next prime is 2013220203143. The reversal of 2013220203131 is 1313020223102.
It is an interprime number because it is at equal distance from previous prime (2013220203119) and next prime (2013220203143).
It is not a de Polignac number, because 2013220203131 - 26 = 2013220203067 is a prime.
It is a super-2 number, since 2×20132202031312 (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 (2013220203031) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 188887541 + ... + 188898198.
It is an arithmetic number, because the mean of its divisors is an integer number (340196058870).
Almost surely, 22013220203131 is an apocalyptic number.
2013220203131 is a deficient number, since it is larger than the sum of its proper divisors (27956150089).
2013220203131 is an frugal number, since it uses more digits than its factorization.
2013220203131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 377785885 (or 377785812 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
Adding to 2013220203131 its reverse (1313020223102), we get a palindrome (3326240426233).
The spelling of 2013220203131 in words is "two trillion, thirteen billion, two hundred twenty million, two hundred three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •