Base | Representation |
---|---|
bin | 11101010010001100011… |
… | …101000001100000100011 |
3 | 21010101100200201200002010 |
4 | 131102030131001200203 |
5 | 230432344141104443 |
6 | 4140252335524003 |
7 | 265251114140562 |
oct | 35221435014043 |
9 | 7111320650063 |
10 | 2012401113123 |
11 | 7064aaa68705 |
12 | 286025089603 |
13 | 1179cb83a02b |
14 | 6d587881bd9 |
15 | 37531a81733 |
hex | 1d48c741823 |
2012401113123 has 8 divisors (see below), whose sum is σ = 2683362694336. Its totient is φ = 1341520137000.
The previous prime is 2012401113089. The next prime is 2012401113161. The reversal of 2012401113123 is 3213111042102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 2012401113123 - 29 = 2012401112611 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 2012401113123.
It is not an unprimeable number, because it can be changed into a prime (2012401183123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20092993 + ... + 20192898.
It is an arithmetic number, because the mean of its divisors is an integer number (335420336792).
Almost surely, 22012401113123 is an apocalyptic number.
2012401113123 is a deficient number, since it is larger than the sum of its proper divisors (670961581213).
2012401113123 is a wasteful number, since it uses less digits than its factorization.
2012401113123 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40302545.
The product of its (nonzero) digits is 288, while the sum is 21.
Adding to 2012401113123 its reverse (3213111042102), we get a palindrome (5225512155225).
The spelling of 2012401113123 in words is "two trillion, twelve billion, four hundred one million, one hundred thirteen thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.789 sec. • engine limits •