Search a number
-
+
1001101101111 = 32255743501547
BaseRepresentation
bin11101001000101100100…
…01101000100000110111
310112201000110100011020200
432210112101220200313
5112400223340213421
62043522142531543
7132220134646236
oct16442621504067
93481013304220
101001101101111
11356623522511
1214202a896bb3
1373532443767
143664c790b1d
151b093268726
hexe916468837

1001101101111 has 12 divisors (see below), whose sum is σ = 1446600477192. Its totient is φ = 667139709456.

The previous prime is 1001101101101. The next prime is 1001101101127. The reversal of 1001101101111 is 1111011011001.

Adding to 1001101101111 its reverse (1111011011001), we get a palindrome (2112112112112).

It is not a de Polignac number, because 1001101101111 - 27 = 1001101100983 is a prime.

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

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

It is a congruent number.

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

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

Almost surely, 21001101101111 is an apocalyptic number.

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

1001101101111 is a wasteful number, since it uses less digits than its factorization.

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

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

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

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

Divisors: 1 3 9 2557 7671 23013 43501547 130504641 391513923 111233455679 333700367037 1001101101111