Base | Representation |
---|---|
bin | 11110101111000101011… |
… | …111111101111011010001 |
3 | 21110220210211121202021121 |
4 | 132233011133331323101 |
5 | 234101131430342001 |
6 | 4254145502322241 |
7 | 305411600315545 |
oct | 36570537757321 |
9 | 7426724552247 |
10 | 2112142434001 |
11 | 744833382306 |
12 | 2a1420289381 |
13 | 1242358887b2 |
14 | 7432a407a25 |
15 | 39e1d2206a1 |
hex | 1ebc57fded1 |
2112142434001 has 4 divisors (see below), whose sum is σ = 2112300459072. Its totient is φ = 2111984408932.
The previous prime is 2112142433987. The next prime is 2112142434011. The reversal of 2112142434001 is 1004342412112.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2112142434001 - 211 = 2112142431953 is a prime.
It is a super-2 number, since 2×21121424340012 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2112142434011) 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, 78992485 + ... + 79019218.
It is an arithmetic number, because the mean of its divisors is an integer number (528075114768).
Almost surely, 22112142434001 is an apocalyptic number.
It is an amenable number.
2112142434001 is a deficient number, since it is larger than the sum of its proper divisors (158025071).
2112142434001 is a wasteful number, since it uses less digits than its factorization.
2112142434001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 158025070.
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 2112142434001 its reverse (1004342412112), we get a palindrome (3116484846113).
The spelling of 2112142434001 in words is "two trillion, one hundred twelve billion, one hundred forty-two million, four hundred thirty-four thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.278 sec. • engine limits •