Search a number
-
+
1101112011122 = 2550556005561
BaseRepresentation
bin10000000001011111011…
…000111110100101110010
310220021011101111210012212
4100001133120332211302
5121020034133323442
62201502135452122
7142360403444324
oct20013730764562
93807141453185
101101112011122
11394a8502a452
121594a0227042
137cab02a3016
143b419051614
151d99840aa82
hex1005f63e972

1101112011122 has 4 divisors (see below), whose sum is σ = 1651668016686. Its totient is φ = 550556005560.

The previous prime is 1101112011047. The next prime is 1101112011217. The reversal of 1101112011122 is 2211102111011.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in only one way, i.e., 1081768486561 + 19343524561 = 1040081^2 + 139081^2 .

It is a super-2 number, since 2×11011120111222 (a number of 25 digits) contains 22 as substring.

It is a junction number, because it is equal to n+sod(n) for n = 1101112011097 and 1101112011106.

It is an unprimeable number.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 275278002779 + ... + 275278002782.

Almost surely, 21101112011122 is an apocalyptic number.

1101112011122 is a deficient number, since it is larger than the sum of its proper divisors (550556005564).

1101112011122 is an equidigital number, since it uses as much as digits as its factorization.

1101112011122 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 550556005563.

The product of its (nonzero) digits is 8, while the sum is 14.

Adding to 1101112011122 its reverse (2211102111011), we get a palindrome (3312214122133).

The spelling of 1101112011122 in words is "one trillion, one hundred one billion, one hundred twelve million, eleven thousand, one hundred twenty-two".

Divisors: 1 2 550556005561 1101112011122