Search a number
-
+
11010105151 = 4310911871979
BaseRepresentation
bin10100100000100000…
…01101111100111111
31001102022110021220021
422100100031330333
5140022041331101
65020304433011
7536561230633
oct122020157477
931368407807
1011010105151
11473aa0aa61
122173318767
131066055026
14766380dc3
154468d85a1
hex29040df3f

11010105151 has 16 divisors (see below), whose sum is σ = 11384841600. Its totient is φ = 10641038688.

The previous prime is 11010105143. The next prime is 11010105203. The reversal of 11010105151 is 15150101011.

11010105151 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is not a de Polignac number, because 11010105151 - 23 = 11010105143 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

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

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

Almost surely, 211010105151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 3318.

The product of its (nonzero) digits is 25, while the sum is 16.

Adding to 11010105151 its reverse (15150101011), we get a palindrome (26160206162).

The spelling of 11010105151 in words is "eleven billion, ten million, one hundred five thousand, one hundred fifty-one".

Divisors: 1 43 109 1187 1979 4687 51041 85097 129383 215711 2349073 5563469 9275573 101010139 256048957 11010105151