Base | Representation |
---|---|
bin | 10000001010111000101… |
… | …011101000111111100011 |
3 | 10221020012102212020101202 |
4 | 100022320223220333203 |
5 | 121201214200311321 |
6 | 2210251144351415 |
7 | 143165400146354 |
oct | 20127053507743 |
9 | 3836172766352 |
10 | 1111200010211 |
11 | 399291489485 |
12 | 15b43677556b |
13 | 80a2a291755 |
14 | 3bad4b5dd2b |
15 | 1dd88d9c70b |
hex | 102b8ae8fe3 |
1111200010211 has 4 divisors (see below), whose sum is σ = 1176564716712. Its totient is φ = 1045835303712.
The previous prime is 1111200010187. The next prime is 1111200010241. The reversal of 1111200010211 is 1120100021111.
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 1111200010211 - 210 = 1111200009187 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1111200010192 and 1111200010201.
It is not an unprimeable number, because it can be changed into a prime (1111200010241) 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, 32682353225 + ... + 32682353258.
It is an arithmetic number, because the mean of its divisors is an integer number (294141179178).
Almost surely, 21111200010211 is an apocalyptic number.
1111200010211 is a deficient number, since it is larger than the sum of its proper divisors (65364706501).
1111200010211 is an equidigital number, since it uses as much as digits as its factorization.
1111200010211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65364706500.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 1111200010211 its reverse (1120100021111), we get a palindrome (2231300031322).
The spelling of 1111200010211 in words is "one trillion, one hundred eleven billion, two hundred million, ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •