Base | Representation |
---|---|
bin | 11101010010001001000… |
… | …011101001111100000011 |
3 | 21010101012201111200202101 |
4 | 131102021003221330003 |
5 | 230432240044200311 |
6 | 4140242542331231 |
7 | 265246522614112 |
oct | 35221103517403 |
9 | 7111181450671 |
10 | 2012344131331 |
11 | 706480889416 |
12 | 286009b89b17 |
13 | 1179bcaa8ab1 |
14 | 6d58008bc79 |
15 | 3752ba77ec1 |
hex | 1d4890e9f03 |
2012344131331 has 2 divisors, whose sum is σ = 2012344131332. Its totient is φ = 2012344131330.
The previous prime is 2012344131269. The next prime is 2012344131337. The reversal of 2012344131331 is 1331314432102.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2012344131331 is a prime.
It is a super-2 number, since 2×20123441313312 (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 2012344131331.
It is not a weakly prime, because it can be changed into another prime (2012344131337) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1006172065665 + 1006172065666.
It is an arithmetic number, because the mean of its divisors is an integer number (1006172065666).
Almost surely, 22012344131331 is an apocalyptic number.
2012344131331 is a deficient number, since it is larger than the sum of its proper divisors (1).
2012344131331 is an equidigital number, since it uses as much as digits as its factorization.
2012344131331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 28.
Adding to 2012344131331 its reverse (1331314432102), we get a palindrome (3343658563433).
The spelling of 2012344131331 in words is "two trillion, twelve billion, three hundred forty-four million, one hundred thirty-one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •