Base | Representation |
---|---|
bin | 10000000000101001000… |
… | …010101111011000101011 |
3 | 10220011210211210120222102 |
4 | 100000221002233120223 |
5 | 121011202223241021 |
6 | 2201231444444015 |
7 | 142325662334015 |
oct | 20005102573053 |
9 | 3804724716872 |
10 | 1100200212011 |
11 | 39465737926a |
12 | 1592869a960b |
13 | 7c996407c14 |
14 | 3b36dd031b5 |
15 | 1d94334d00b |
hex | 100290af62b |
1100200212011 has 4 divisors (see below), whose sum is σ = 1100524854000. Its totient is φ = 1099875570024.
The previous prime is 1100200211977. The next prime is 1100200212101. The reversal of 1100200212011 is 1102120020011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1100200212011 - 210 = 1100200210987 is a prime.
It is a super-4 number, since 4×11002002120114 (a number of 49 digits) contains 4444 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1100200211983 and 1100200212001.
It is not an unprimeable number, because it can be changed into a prime (1100200212211) 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, 162315911 + ... + 162322688.
It is an arithmetic number, because the mean of its divisors is an integer number (275131213500).
Almost surely, 21100200212011 is an apocalyptic number.
1100200212011 is a deficient number, since it is larger than the sum of its proper divisors (324641989).
1100200212011 is an equidigital number, since it uses as much as digits as its factorization.
1100200212011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 324641988.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1100200212011 its reverse (1102120020011), we get a palindrome (2202320232022).
The spelling of 1100200212011 in words is "one trillion, one hundred billion, two hundred million, two hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •