Base | Representation |
---|---|
bin | 10000001010110010101… |
… | …110001011001011001011 |
3 | 10221012221110200202120002 |
4 | 100022302232023023023 |
5 | 121201013100324321 |
6 | 2210233213153215 |
7 | 143163044160161 |
oct | 20126256131313 |
9 | 3835843622502 |
10 | 1111100011211 |
11 | 39923aa98783 |
12 | 15b40918b80b |
13 | 80a1264b548 |
14 | 3bac576d231 |
15 | 1dd801e820b |
hex | 102b2b8b2cb |
1111100011211 has 4 divisors (see below), whose sum is σ = 1111104743400. Its totient is φ = 1111095279024.
The previous prime is 1111100011207. The next prime is 1111100011223. The reversal of 1111100011211 is 1121100011111.
It is a happy number.
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 1111100011211 - 22 = 1111100011207 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1111100011192 and 1111100011201.
It is not an unprimeable number, because it can be changed into a prime (1111100011271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1994441 + ... + 2489978.
It is an arithmetic number, because the mean of its divisors is an integer number (277776185850).
Almost surely, 21111100011211 is an apocalyptic number.
1111100011211 is a deficient number, since it is larger than the sum of its proper divisors (4732189).
1111100011211 is an equidigital number, since it uses as much as digits as its factorization.
1111100011211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4732188.
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 1111100011211 its reverse (1121100011111), we get a palindrome (2232200022322).
The spelling of 1111100011211 in words is "one trillion, one hundred eleven billion, one hundred million, eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •