Base | Representation |
---|---|
bin | 11001010010001100000110… |
… | …001100001010010100001011 |
3 | 112120201201111000001222112220 |
4 | 121102030012030022110023 |
5 | 104033404324120041021 |
6 | 1032301025302305123 |
7 | 32265004655153262 |
oct | 3122140614122413 |
9 | 476651430058486 |
10 | 111201102112011 |
11 | 3248313915435a |
12 | 1057b6281281a3 |
13 | 4a082accc9242 |
14 | 1d6623a9975d9 |
15 | ccc8e104ecc6 |
hex | 65230630a50b |
111201102112011 has 4 divisors (see below), whose sum is σ = 148268136149352. Its totient is φ = 74134068074672.
The previous prime is 111201102111943. The next prime is 111201102112021. The reversal of 111201102112011 is 110211201102111.
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 111201102112011 - 214 = 111201102095627 is a prime.
It is a super-2 number, since 2×1112011021120112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (111201102112021) 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, 18533517018666 + ... + 18533517018671.
It is an arithmetic number, because the mean of its divisors is an integer number (37067034037338).
Almost surely, 2111201102112011 is an apocalyptic number.
111201102112011 is a deficient number, since it is larger than the sum of its proper divisors (37067034037341).
111201102112011 is an equidigital number, since it uses as much as digits as its factorization.
111201102112011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37067034037340.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 111201102112011 its reverse (110211201102111), we get a palindrome (221412303214122).
The spelling of 111201102112011 in words is "one hundred eleven trillion, two hundred one billion, one hundred two million, one hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •