Base | Representation |
---|---|
bin | 11001010001000001101011… |
… | …101001110011001111011011 |
3 | 112120110002020111011020101111 |
4 | 121101001223221303033123 |
5 | 104031102204200031021 |
6 | 1032200212523001151 |
7 | 32256145632345253 |
oct | 3121015351631733 |
9 | 476402214136344 |
10 | 111121200002011 |
11 | 32452266528501 |
12 | 105680490691b7 |
13 | 4a008b8249704 |
14 | 1d6241ac20963 |
15 | cca7b646a8e1 |
hex | 65106ba733db |
111121200002011 has 8 divisors (see below), whose sum is σ = 111362431256064. Its totient is φ = 110879974044840.
The previous prime is 111121200002009. The next prime is 111121200002023. The reversal of 111121200002011 is 110200002121111.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 111121200002011 - 21 = 111121200002009 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 111121200001982 and 111121200002000.
It is not an unprimeable number, because it can be changed into a prime (111121200008011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 42231570 + ... + 44785576.
It is an arithmetic number, because the mean of its divisors is an integer number (13920303907008).
Almost surely, 2111121200002011 is an apocalyptic number.
111121200002011 is a deficient number, since it is larger than the sum of its proper divisors (241231254053).
111121200002011 is an equidigital number, since it uses as much as digits as its factorization.
111121200002011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2648441.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 111121200002011 its reverse (110200002121111), we get a palindrome (221321202123122).
The spelling of 111121200002011 in words is "one hundred eleven trillion, one hundred twenty-one billion, two hundred million, two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •