Search a number
-
+
11111010101001 = 321518175872039
BaseRepresentation
bin1010000110101111101111…
…0011110110011100001001
31110100012110101202002202200
42201223323303312130021
52424020322041213001
635344154431150413
72224513121364546
oct241537363663411
943305411662680
1011111010101001
1135a41755a1938
1212b547a975409
136279c0c86955
142a5ac0975bcd
151440522cb086
hexa1afbcf6709

11111010101001 has 12 divisors (see below), whose sum is σ = 16155523151040. Its totient is φ = 7358284834200.

The previous prime is 11111010100969. The next prime is 11111010101011. The reversal of 11111010101001 is 10010101011111.

It is not a de Polignac number, because 11111010101001 - 25 = 11111010100969 is a prime.

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

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

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

Almost surely, 211111010101001 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 11111010101001 its reverse (10010101011111), we get a palindrome (21121111112112).

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

Divisors: 1 3 9 151 453 1359 8175872039 24527616117 73582848351 1234556677889 3703670033667 11111010101001