Base | Representation |
---|---|
bin | 11101010001110111000… |
… | …111110100101101010011 |
3 | 21010100102202022112101122 |
4 | 131101313013310231103 |
5 | 230431131031443011 |
6 | 4140153033152455 |
7 | 265236210206600 |
oct | 35216707645523 |
9 | 7110382275348 |
10 | 2012043234131 |
11 | 706336a51947 |
12 | 285b4525b72b |
13 | 117972655808 |
14 | 6d5521236a7 |
15 | 3751043d3db |
hex | 1d4771f4b53 |
2012043234131 has 6 divisors (see below), whose sum is σ = 2340540088740. Its totient is φ = 1724608486356.
The previous prime is 2012043234121. The next prime is 2012043234139. The reversal of 2012043234131 is 1314323402102.
It is not a de Polignac number, because 2012043234131 - 210 = 2012043233107 is a prime.
It is a super-2 number, since 2×20120432341312 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2012043234131.
It is not an unprimeable number, because it can be changed into a prime (2012043234139) 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, 20531053361 + ... + 20531053458.
It is an arithmetic number, because the mean of its divisors is an integer number (390090014790).
Almost surely, 22012043234131 is an apocalyptic number.
2012043234131 is a deficient number, since it is larger than the sum of its proper divisors (328496854609).
2012043234131 is an equidigital number, since it uses as much as digits as its factorization.
2012043234131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 41062106833 (or 41062106826 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 26.
Adding to 2012043234131 its reverse (1314323402102), we get a palindrome (3326366636233).
The spelling of 2012043234131 in words is "two trillion, twelve billion, forty-three million, two hundred thirty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •