Search a number
-
+
151056657 = 341864897
BaseRepresentation
bin10010000000011…
…11000100010001
3101112020110210000
421000033010101
5302132303112
622553400213
73512650263
oct1100170421
9345213700
10151056657
11782a4114
1242709069
13253abb4b
14160c1b33
15d3dc7dc
hex900f111

151056657 has 10 divisors (see below), whose sum is σ = 225652658. Its totient is φ = 100704384.

The previous prime is 151056649. The next prime is 151056667. The reversal of 151056657 is 756650151.

It can be written as a sum of positive squares in only one way, i.e., 96059601 + 54997056 = 9801^2 + 7416^2 .

It is not a de Polignac number, because 151056657 - 23 = 151056649 is a prime.

It is a super-2 number, since 2×1510566572 = 45636227248031298, which contains 22 as substring.

It is a Duffinian number.

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

It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 932368 + ... + 932529.

Almost surely, 2151056657 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 31500, while the sum is 36.

The square root of 151056657 is about 12290.5108518727. The cubic root of 151056657 is about 532.5739948751.

The spelling of 151056657 in words is "one hundred fifty-one million, fifty-six thousand, six hundred fifty-seven".

Divisors: 1 3 9 27 81 1864897 5594691 16784073 50352219 151056657