Search a number
-
+
1102011102011 = 6919315926627
BaseRepresentation
bin10000000010010100111…
…110101111001100111011
310220100111001022100001102
4100002110332233030323
5121023404320231021
62202131254242015
7142421601545501
oct20022476571473
93810431270042
101102011102011
113953a65a0776
121596b135630b
137cbc463b971
143b4a2612671
151d9ec30800b
hex10094faf33b

1102011102011 has 4 divisors (see below), whose sum is σ = 1102027097832. Its totient is φ = 1101995106192.

The previous prime is 1102011101977. The next prime is 1102011102047.

1102011102011 is nontrivially palindromic in base 10.

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 1102011102011 - 222 = 1102006907707 is a prime.

It is a Duffinian number.

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

It is not an unprimeable number, because it can be changed into a prime (1102011107011) 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, 7894121 + ... + 8032506.

It is an arithmetic number, because the mean of its divisors is an integer number (275506774458).

Almost surely, 21102011102011 is an apocalyptic number.

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

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

1102011102011 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 15995820.

The product of its (nonzero) digits is 4, while the sum is 11.

Multiplying 1102011102011 by its sum of digits (11), we get a palindrome (12122122122121).

The spelling of 1102011102011 in words is "one trillion, one hundred two billion, eleven million, one hundred two thousand, eleven".

Divisors: 1 69193 15926627 1102011102011