Search a number
-
+
11010010111101 = 332317729484881
BaseRepresentation
bin1010000000110111011110…
…1111011101110001111101
31102222112202112110000021000
42200031313233131301331
52420342000042023401
635225532343000513
72214306212546601
oct240156757356175
942875675400230
1011010010111101
11356535674a601
121299992139139
1361b316241811
142a0c5cbab501
151415e03b3186
hexa0377bddc7d

11010010111101 has 16 divisors (see below), whose sum is σ = 17020305486720. Its totient is φ = 7020876012480.

The previous prime is 11010010111091. The next prime is 11010010111123. The reversal of 11010010111101 is 10111101001011.

It is not a de Polignac number, because 11010010111101 - 211 = 11010010109053 is a prime.

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (11010010111151) by changing a digit.

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 8864741820 + ... + 8864743061.

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

Almost surely, 211010010111101 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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

Adding to 11010010111101 its reverse (10111101001011), we get a palindrome (21121111112112).

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

Divisors: 1 3 9 23 27 69 207 621 17729484881 53188454643 159565363929 407778152263 478696091787 1223334456789 3670003370367 11010010111101