Base | Representation |
---|---|
bin | 11110100100110100000… |
… | …011011101011101110101 |
3 | 21102212100010112102020221 |
4 | 132210310003131131311 |
5 | 233411034224030401 |
6 | 4245123201054341 |
7 | 304541344062331 |
oct | 36446403353565 |
9 | 7385303472227 |
10 | 2101112330101 |
11 | 740093152a64 |
12 | 29b2623273b1 |
13 | 123198650ab5 |
14 | 739a153c7c1 |
15 | 399c4bd67a1 |
hex | 1e9340dd775 |
2101112330101 has 8 divisors (see below), whose sum is σ = 2236547721600. Its totient is φ = 1968161991840.
The previous prime is 2101112330071. The next prime is 2101112330137. The reversal of 2101112330101 is 1010332111012.
It is a happy number.
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 2101112330101 - 213 = 2101112321909 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2101112330171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 621261565 + ... + 621264946.
It is an arithmetic number, because the mean of its divisors is an integer number (279568465200).
Almost surely, 22101112330101 is an apocalyptic number.
It is an amenable number.
2101112330101 is a deficient number, since it is larger than the sum of its proper divisors (135435391499).
2101112330101 is a wasteful number, since it uses less digits than its factorization.
2101112330101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1242526619.
The product of its (nonzero) digits is 36, while the sum is 16.
Adding to 2101112330101 its reverse (1010332111012), we get a palindrome (3111444441113).
The spelling of 2101112330101 in words is "two trillion, one hundred one billion, one hundred twelve million, three hundred thirty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •