Base | Representation |
---|---|
bin | 11101010001110101001… |
… | …101101111010001111011 |
3 | 21010100100112002120102201 |
4 | 131101311031233101323 |
5 | 230431044333332311 |
6 | 4140145531211031 |
7 | 265235341164214 |
oct | 35216515572173 |
9 | 7110315076381 |
10 | 2012011230331 |
11 | 70631a982a23 |
12 | 285b365a6a77 |
13 | 117968b2b75b |
14 | 6d54bb9240b |
15 | 3750c71a9c1 |
hex | 1d47536f47b |
2012011230331 has 4 divisors (see below), whose sum is σ = 2012070498592. Its totient is φ = 2011951962072.
The previous prime is 2012011230329. The next prime is 2012011230377. The reversal of 2012011230331 is 1330321102102.
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 2012011230331 - 21 = 2012011230329 is a prime.
It is a super-2 number, since 2×20120112303312 (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 = 2012011230299 and 2012011230308.
It is not an unprimeable number, because it can be changed into a prime (2012018230331) 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, 29583180 + ... + 29651113.
It is an arithmetic number, because the mean of its divisors is an integer number (503017624648).
Almost surely, 22012011230331 is an apocalyptic number.
2012011230331 is a deficient number, since it is larger than the sum of its proper divisors (59268261).
2012011230331 is an equidigital number, since it uses as much as digits as its factorization.
2012011230331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 59268260.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 2012011230331 its reverse (1330321102102), we get a palindrome (3342332332433).
The spelling of 2012011230331 in words is "two trillion, twelve billion, eleven million, two hundred thirty thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •