Search a number
-
+
1101200011011 = 3340785185593
BaseRepresentation
bin10000000001100100101…
…000101010111100000011
310220021101112002122101000
4100001210220222330003
5121020224200323021
62201515001543043
7142362522436632
oct20014450527403
93807345078330
101101200011011
1139501a775031
121595057a4a83
137cac55a4769
143b4269db519
151d9a0edeb26
hex10064a2af03

1101200011011 has 8 divisors (see below), whose sum is σ = 1631407423760. Its totient is φ = 734133340656.

The previous prime is 1101200011007. The next prime is 1101200011147. The reversal of 1101200011011 is 1101100021011.

It is not a de Polignac number, because 1101200011011 - 22 = 1101200011007 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9).

It is a Duffinian number.

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

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

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

Almost surely, 21101200011011 is an apocalyptic number.

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

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

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

The sum of its prime factors is 40785185602 (or 40785185596 counting only the distinct ones).

The product of its (nonzero) digits is 2, while the sum is 9.

Adding to 1101200011011 its reverse (1101100021011), we get a palindrome (2202300032022).

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

Divisors: 1 3 9 27 40785185593 122355556779 367066670337 1101200011011