Search a number
-
+
100005151 = 195263429
BaseRepresentation
bin1011111010111…
…11010100011111
320222011210021111
411331133110133
5201100131101
613531242451
72323013131
oct575372437
9228153244
10100005151
11514a5394
12295a9427
1317945c5c
14d3d3051
158ba6251
hex5f5f51f

100005151 has 4 divisors (see below), whose sum is σ = 105268600. Its totient is φ = 94741704.

The previous prime is 100005149. The next prime is 100005193. The reversal of 100005151 is 151500001.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 100005151 - 21 = 100005149 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 (100005121) 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, 2631696 + ... + 2631733.

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

Almost surely, 2100005151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 5263448.

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

The square root of 100005151 is about 10000.2575466835. The cubic root of 100005151 is about 464.1668528325.

Adding to 100005151 its reverse (151500001), we get a palindrome (251505152).

It can be divided in two parts, 10000 and 5151, that added together give a palindrome (15151).

The spelling of 100005151 in words is "one hundred million, five thousand, one hundred fifty-one".

Divisors: 1 19 5263429 100005151