Base | Representation |
---|---|
bin | 11101010010111100001… |
… | …101010110001111110011 |
3 | 21010110102112022200202101 |
4 | 131102330031112033303 |
5 | 230441014242411011 |
6 | 4140504040201231 |
7 | 265310013201115 |
oct | 35227415261763 |
9 | 7113375280671 |
10 | 2013202310131 |
11 | 7068812468a1 |
12 | 286209469217 |
13 | 117ac881b9bc |
14 | 6d62203d3b5 |
15 | 3757c0932c1 |
hex | 1d4bc3563f3 |
2013202310131 has 4 divisors (see below), whose sum is σ = 2013287061064. Its totient is φ = 2013117559200.
The previous prime is 2013202310059. The next prime is 2013202310159. The reversal of 2013202310131 is 1310132023102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2013202310131 - 27 = 2013202310003 is a prime.
It is a super-2 number, since 2×20132023101312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2013202310099 and 2013202310108.
It is not an unprimeable number, because it can be changed into a prime (2013202370131) 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, 42339825 + ... + 42387346.
It is an arithmetic number, because the mean of its divisors is an integer number (503321765266).
Almost surely, 22013202310131 is an apocalyptic number.
2013202310131 is a deficient number, since it is larger than the sum of its proper divisors (84750933).
2013202310131 is an equidigital number, since it uses as much as digits as its factorization.
2013202310131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 84750932.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 2013202310131 its reverse (1310132023102), we get a palindrome (3323334333233).
The spelling of 2013202310131 in words is "two trillion, thirteen billion, two hundred two million, three hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •