Base | Representation |
---|---|
bin | 10000001010111000101… |
… | …100011001110001011011 |
3 | 10221020012110020101110202 |
4 | 100022320230121301123 |
5 | 121201214223210021 |
6 | 2210251152532415 |
7 | 143165401641023 |
oct | 20127054316133 |
9 | 3836173211422 |
10 | 1111200210011 |
11 | 399291605601 |
12 | 15b43685110b |
13 | 80a2a331688 |
14 | 3bad4bb2a83 |
15 | 1dd88ddba0b |
hex | 102b8b19c5b |
1111200210011 has 4 divisors (see below), whose sum is σ = 1111203678792. Its totient is φ = 1111196741232.
The previous prime is 1111200209957. The next prime is 1111200210013. The reversal of 1111200210011 is 1100120021111.
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 1111200210011 - 222 = 1111196015707 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1111200209974 and 1111200210001.
It is not an unprimeable number, because it can be changed into a prime (1111200210013) 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, 1198730 + ... + 1912943.
It is an arithmetic number, because the mean of its divisors is an integer number (277800919698).
Almost surely, 21111200210011 is an apocalyptic number.
1111200210011 is a deficient number, since it is larger than the sum of its proper divisors (3468781).
1111200210011 is an equidigital number, since it uses as much as digits as its factorization.
1111200210011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3468780.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 1111200210011 its reverse (1100120021111), we get a palindrome (2211320231122).
The spelling of 1111200210011 in words is "one trillion, one hundred eleven billion, two hundred million, two hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •