Search a number
-
+
10010001111 = 311331991393
BaseRepresentation
bin10010101001010010…
…00111111011010111
3221211121120202001220
421110221013323113
5131000030013421
64333141021423
7503025414465
oct112451077327
927747522056
1010010001111
114277425aa0
121b343b4873
13c36aac6a6
146ad607835
153d8bd63c6
hex254a47ed7

10010001111 has 16 divisors (see below), whose sum is σ = 14564547840. Its totient is φ = 6064773120.

The previous prime is 10010001103. The next prime is 10010001121. The reversal of 10010001111 is 11110001001.

It is not a de Polignac number, because 10010001111 - 23 = 10010001103 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 10010001111.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 210010001111 is an apocalyptic number.

10010001111 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

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

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

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

The sum of its prime factors is 94726.

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

Adding to 10010001111 its reverse (11110001001), we get a palindrome (21120002112).

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

Divisors: 1 3 11 33 3319 9957 36509 91393 109527 274179 1005323 3015969 303333367 910000101 3336667037 10010001111