Base | Representation |
---|---|
bin | 10000000000011101001… |
… | …011100101000000100011 |
3 | 10220011021222022211212002 |
4 | 100000131023211000203 |
5 | 121010300301432321 |
6 | 2201200015154215 |
7 | 142321024642352 |
oct | 20003513450043 |
9 | 3804258284762 |
10 | 1100001202211 |
11 | 39456500225a |
12 | 15923021596b |
13 | 7c964109542 |
14 | 3b3516db999 |
15 | 1d930b3c20b |
hex | 1001d2e5023 |
1100001202211 has 4 divisors (see below), whose sum is σ = 1100802369792. Its totient is φ = 1099200034632.
The previous prime is 1100001202151. The next prime is 1100001202217. The reversal of 1100001202211 is 1122021000011.
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 1100001202211 - 230 = 1098927460387 is a prime.
It is a super-2 number, since 2×11000012022112 (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 = 1100001202192 and 1100001202201.
It is not an unprimeable number, because it can be changed into a prime (1100001202217) 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, 400581731 + ... + 400584476.
It is an arithmetic number, because the mean of its divisors is an integer number (275200592448).
Almost surely, 21100001202211 is an apocalyptic number.
1100001202211 is a deficient number, since it is larger than the sum of its proper divisors (801167581).
1100001202211 is an equidigital number, since it uses as much as digits as its factorization.
1100001202211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 801167580.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1100001202211 its reverse (1122021000011), we get a palindrome (2222022202222).
The spelling of 1100001202211 in words is "one trillion, one hundred billion, one million, two hundred two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.217 sec. • engine limits •