Search a number
-
+
100010151 = 3211112239
BaseRepresentation
bin1011111011000…
…00100010100111
320222012001010200
411331200202213
5201100311101
613531321543
72323033533
oct575404247
9228161120
10100010151
11514a911a
12295b02b3
1317948307
14d3d4bc3
158ba7986
hex5f608a7

100010151 has 6 divisors (see below), whose sum is σ = 144459120. Its totient is φ = 66673428.

The previous prime is 100010143. The next prime is 100010161. The reversal of 100010151 is 151010001.

It is not a de Polignac number, because 100010151 - 23 = 100010143 is a prime.

It is a Harshad number since it is a multiple of its sum of digits (9), and also a Moran number because the ratio is a prime number: 11112239 = 100010151 / (1 + 0 + 0 + 0 + 1 + 0 + 1 + 5 + 1).

It is a congruent number.

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

It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 5556111 + ... + 5556128.

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

Almost surely, 2100010151 is an apocalyptic number.

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

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

100010151 is an evil number, because the sum of its binary digits is even.

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

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

The square root of 100010151 is about 10000.5075371203. The cubic root of 100010151 is about 464.1745884193.

Adding to 100010151 its reverse (151010001), we get a palindrome (251020152).

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

Divisors: 1 3 9 11112239 33336717 100010151