Base | Representation |
---|---|
bin | 10000000000101001000… |
… | …110100011100011001111 |
3 | 10220011210220200101212011 |
4 | 100000221012203203033 |
5 | 121011203002241421 |
6 | 2201231522122051 |
7 | 142326004000531 |
oct | 20005106434317 |
9 | 3804726611764 |
10 | 1100201212111 |
11 | 3946579a16a1 |
12 | 1592871b0327 |
13 | 7c9966981b1 |
14 | 3b3700c3851 |
15 | 1d9434994e1 |
hex | 100291a38cf |
1100201212111 has 16 divisors (see below), whose sum is σ = 1139775185920. Its totient is φ = 1060885200960.
The previous prime is 1100201212091. The next prime is 1100201212129. The reversal of 1100201212111 is 1112121020011.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1100201212111 - 25 = 1100201212079 is a prime.
It is a super-2 number, since 2×11002012121112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1100201212091 and 1100201212100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100201212211) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 25778956 + ... + 25821598.
It is an arithmetic number, because the mean of its divisors is an integer number (71235949120).
Almost surely, 21100201212111 is an apocalyptic number.
1100201212111 is a deficient number, since it is larger than the sum of its proper divisors (39573973809).
1100201212111 is a wasteful number, since it uses less digits than its factorization.
1100201212111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 45646.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1100201212111 its reverse (1112121020011), we get a palindrome (2212322232122).
The spelling of 1100201212111 in words is "one trillion, one hundred billion, two hundred one million, two hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •