Base | Representation |
---|---|
bin | 11101010001111010110… |
… | …000000011100011001011 |
3 | 21010100120222212110120210 |
4 | 131101322300003203023 |
5 | 230431242123043311 |
6 | 4140203050052203 |
7 | 265240546522215 |
oct | 35217260034313 |
9 | 7110528773523 |
10 | 2012104112331 |
11 | 706368352605 |
12 | 285b6171a063 |
13 | 11798214c411 |
14 | 6d55a24d5b5 |
15 | 375159663a6 |
hex | 1d47ac038cb |
2012104112331 has 8 divisors (see below), whose sum is σ = 2684180583424. Its totient is φ = 1340715191400.
The previous prime is 2012104112321. The next prime is 2012104112371. The reversal of 2012104112331 is 1332114012102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2012104112331 - 29 = 2012104111819 is a prime.
It is a super-2 number, since 2×20121041123312 (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 = 2012104112298 and 2012104112307.
It is not an unprimeable number, because it can be changed into a prime (2012104112321) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 171880711 + ... + 171892416.
It is an arithmetic number, because the mean of its divisors is an integer number (335522572928).
Almost surely, 22012104112331 is an apocalyptic number.
2012104112331 is a deficient number, since it is larger than the sum of its proper divisors (672076471093).
2012104112331 is a wasteful number, since it uses less digits than its factorization.
2012104112331 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 343775081.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 2012104112331 its reverse (1332114012102), we get a palindrome (3344218124433).
The spelling of 2012104112331 in words is "two trillion, twelve billion, one hundred four million, one hundred twelve thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •