Base | Representation |
---|---|
bin | 11110110110011001110… |
… | …110101000010111100101 |
3 | 21111200002110020011020102 |
4 | 132312121312220113211 |
5 | 234213230012041401 |
6 | 4301525315513445 |
7 | 306110402425214 |
oct | 36663166502745 |
9 | 7450073204212 |
10 | 2120000112101 |
11 | 7480a5882153 |
12 | 2a2a538b8885 |
13 | 124bb878a771 |
14 | 74873c2507b |
15 | 3a22cea656b |
hex | 1ed99da85e5 |
2120000112101 has 4 divisors (see below), whose sum is σ = 2135474565612. Its totient is φ = 2104525658592.
The previous prime is 2120000112023. The next prime is 2120000112151. The reversal of 2120000112101 is 1012110000212.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1364188960225 + 755811151876 = 1167985^2 + 869374^2 .
It is a cyclic number.
It is not a de Polignac number, because 2120000112101 - 234 = 2102820242917 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 (2120000112151) 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, 7737226550 + ... + 7737226823.
It is an arithmetic number, because the mean of its divisors is an integer number (533868641403).
Almost surely, 22120000112101 is an apocalyptic number.
It is an amenable number.
2120000112101 is a deficient number, since it is larger than the sum of its proper divisors (15474453511).
2120000112101 is a wasteful number, since it uses less digits than its factorization.
2120000112101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15474453510.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 2120000112101 its reverse (1012110000212), we get a palindrome (3132110112313).
The spelling of 2120000112101 in words is "two trillion, one hundred twenty billion, one hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •