Base | Representation |
---|---|
bin | 11101010001111011001… |
… | …111010011100000000011 |
3 | 21010100121120021122121210 |
4 | 131101323033103200003 |
5 | 230431301222213011 |
6 | 4140203541421203 |
7 | 265241006251056 |
oct | 35217317234003 |
9 | 7110546248553 |
10 | 2012112304131 |
11 | 706371a38196 |
12 | 285b6440a803 |
13 | 117983a59c37 |
14 | 6d55b382a9d |
15 | 375165336a6 |
hex | 1d47b3d3803 |
2012112304131 has 4 divisors (see below), whose sum is σ = 2682816405512. Its totient is φ = 1341408202752.
The previous prime is 2012112304121. The next prime is 2012112304171. The reversal of 2012112304131 is 1314032112102.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 2012112304131 - 27 = 2012112304003 is a prime.
It is a super-2 number, since 2×20121123041312 (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 = 2012112304098 and 2012112304107.
It is not an unprimeable number, because it can be changed into a prime (2012112304121) 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, 335352050686 + ... + 335352050691.
It is an arithmetic number, because the mean of its divisors is an integer number (670704101378).
Almost surely, 22012112304131 is an apocalyptic number.
2012112304131 is a deficient number, since it is larger than the sum of its proper divisors (670704101381).
2012112304131 is an equidigital number, since it uses as much as digits as its factorization.
2012112304131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 670704101380.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 2012112304131 its reverse (1314032112102), we get a palindrome (3326144416233).
The spelling of 2012112304131 in words is "two trillion, twelve billion, one hundred twelve million, three hundred four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •