Search a number
-
+
151105251 = 3114578947
BaseRepresentation
bin10010000000110…
…10111011100011
3101112022221102210
421000122323203
5302140332001
622554413203
73513242043
oct1100327343
9345287383
10151105251
1178327680
1242731203
13253c7cbb
14160d5723
15d3ebdd6
hex901aee3

151105251 has 8 divisors (see below), whose sum is σ = 219789504. Its totient is φ = 91578920.

The previous prime is 151105249. The next prime is 151105289. The reversal of 151105251 is 152501151.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 151105251 - 21 = 151105249 is a prime.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2289441 + ... + 2289506.

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

Almost surely, 2151105251 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 4578961.

The product of its (nonzero) digits is 250, while the sum is 21.

The square root of 151105251 is about 12292.4875838863. The cubic root of 151105251 is about 532.6310973482.

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

Divisors: 1 3 11 33 4578947 13736841 50368417 151105251