Search a number
-
+
10051111101 = 33350370367
BaseRepresentation
bin10010101110001011…
…11100100010111101
3221221110221100101010
421113011330202331
5131041041023401
64341210105433
7504035014623
oct112705744275
927843840333
1010051111101
114298654599
121b4611b279
13c42474525
146b4c69513
153dc606ed6
hex25717c8bd

10051111101 has 4 divisors (see below), whose sum is σ = 13401481472. Its totient is φ = 6700740732.

The previous prime is 10051111097. The next prime is 10051111111. The reversal of 10051111101 is 10111115001.

It is a happy number.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is not a de Polignac number, because 10051111101 - 22 = 10051111097 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 (10051111111) 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 3 ways as a sum of consecutive naturals, for example, 1675185181 + ... + 1675185186.

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

Almost surely, 210051111101 is an apocalyptic number.

It is an amenable number.

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

10051111101 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 3350370370.

The product of its (nonzero) digits is 5, while the sum is 12.

Adding to 10051111101 its reverse (10111115001), we get a palindrome (20162226102).

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

Divisors: 1 3 3350370367 10051111101