Base | Representation |
---|---|
bin | 11101010011000100011… |
… | …100001110111100110011 |
3 | 21010110210011012220202221 |
4 | 131103010130032330303 |
5 | 230441310122231011 |
6 | 4140525452421511 |
7 | 265313311201252 |
oct | 35230434167463 |
9 | 7113704186687 |
10 | 2013340430131 |
11 | 706942204458 |
12 | 286247777897 |
13 | 117b1b31b404 |
14 | 6d636514799 |
15 | 37589277971 |
hex | 1d4c470ef33 |
2013340430131 has 4 divisors (see below), whose sum is σ = 2029193504512. Its totient is φ = 1997487355752.
The previous prime is 2013340430099. The next prime is 2013340430137. The reversal of 2013340430131 is 1310340433102.
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 2013340430131 - 25 = 2013340430099 is a prime.
It is a super-2 number, since 2×20133404301312 (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 = 2013340430096 and 2013340430105.
It is not an unprimeable number, because it can be changed into a prime (2013340430137) 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, 7926537000 + ... + 7926537253.
It is an arithmetic number, because the mean of its divisors is an integer number (507298376128).
Almost surely, 22013340430131 is an apocalyptic number.
2013340430131 is a deficient number, since it is larger than the sum of its proper divisors (15853074381).
2013340430131 is a wasteful number, since it uses less digits than its factorization.
2013340430131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15853074380.
The product of its (nonzero) digits is 2592, while the sum is 25.
Adding to 2013340430131 its reverse (1310340433102), we get a palindrome (3323680863233).
The spelling of 2013340430131 in words is "two trillion, thirteen billion, three hundred forty million, four hundred thirty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •