Base | Representation |
---|---|
bin | 11110101110111101001… |
… | …001011100101110001101 |
3 | 21110220110001221212112122 |
4 | 132232331021130232031 |
5 | 234100340043004401 |
6 | 4254123535142325 |
7 | 305405246313032 |
oct | 36567511345615 |
9 | 7426401855478 |
10 | 2112002313101 |
11 | 74477127840a |
12 | 2a13a13749a5 |
13 | 124212838415 |
14 | 74315971389 |
15 | 39e10c9321b |
hex | 1ebbd25cb8d |
2112002313101 has 8 divisors (see below), whose sum is σ = 2299821031200. Its totient is φ = 1931849665200.
The previous prime is 2112002313059. The next prime is 2112002313149. The reversal of 2112002313101 is 1013132002112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 2112002313101 - 26 = 2112002313037 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2112002313101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2112002313401) 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, 1916516975 + ... + 1916518076.
It is an arithmetic number, because the mean of its divisors is an integer number (287477628900).
Almost surely, 22112002313101 is an apocalyptic number.
It is an amenable number.
2112002313101 is a deficient number, since it is larger than the sum of its proper divisors (187818718099).
2112002313101 is a wasteful number, since it uses less digits than its factorization.
2112002313101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3833035099.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 2112002313101 its reverse (1013132002112), we get a palindrome (3125134315213).
The spelling of 2112002313101 in words is "two trillion, one hundred twelve billion, two million, three hundred thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •