Search a number
-
+
151105061 = 1720874259
BaseRepresentation
bin10010000000110…
…10111000100101
3101112022221011202
421000122320211
5302140330221
622554412245
73513241352
oct1100327045
9345287152
10151105061
1178327518
1242731085
13253c7ba3
14160d5629
15d3ebd0b
hex901ae25

151105061 has 8 divisors (see below), whose sum is σ = 160107840. Its totient is φ = 142115008.

The previous prime is 151105057. The next prime is 151105063. The reversal of 151105061 is 160501151.

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 151105061 - 22 = 151105057 is a prime.

It is a Duffinian number.

It is a Curzon number.

It is a congruent number.

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

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

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

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

Almost surely, 2151105061 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 6363.

The product of its (nonzero) digits is 150, while the sum is 20.

The square root of 151105061 is about 12292.4798555865. The cubic root of 151105061 is about 532.6308741043.

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

Divisors: 1 17 2087 4259 35479 72403 8888533 151105061