Base | Representation |
---|---|
bin | 11001010001000000110000… |
… | …110000110111110100001011 |
3 | 112120102222200122001112102211 |
4 | 121101000300300313310023 |
5 | 104031043143233000021 |
6 | 1032155530510405551 |
7 | 32256112304435044 |
oct | 3121006060676413 |
9 | 476388618045384 |
10 | 111120212000011 |
11 | 324518a9859a25 |
12 | 10567a122008b7 |
13 | 4a0078b650646 |
14 | 1d623659178cb |
15 | cca7598593e1 |
hex | 651030c37d0b |
111120212000011 has 12 divisors (see below), whose sum is σ = 115827015061800. Its totient is φ = 106572505832960.
The previous prime is 111120211999999. The next prime is 111120212000029. The reversal of 111120212000011 is 110000212021111.
It is a happy number.
It is not a de Polignac number, because 111120212000011 - 29 = 111120211999499 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 111120211999955 and 111120212000000.
It is not an unprimeable number, because it can be changed into a prime (111120212000041) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 560101126 + ... + 560299483.
It is an arithmetic number, because the mean of its divisors is an integer number (9652251255150).
Almost surely, 2111120212000011 is an apocalyptic number.
111120212000011 is a deficient number, since it is larger than the sum of its proper divisors (4706803061789).
111120212000011 is an equidigital number, since it uses as much as digits as its factorization.
111120212000011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1120400750 (or 1120400709 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 111120212000011 its reverse (110000212021111), we get a palindrome (221120424021122).
The spelling of 111120212000011 in words is "one hundred eleven trillion, one hundred twenty billion, two hundred twelve million, eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •