Search a number
-
+
151046965 = 533239091
BaseRepresentation
bin10010000000011…
…00101100110101
3101112012222111001
421000030230311
5302132000330
622553243301
73512610106
oct1100145465
9345188431
10151046965
1178297903
1242703531
13253a7604
14160bc3ad
15d3d99ca
hex900cb35

151046965 has 8 divisors (see below), whose sum is σ = 181330848. Its totient is φ = 120787920.

The previous prime is 151046963. The next prime is 151046971. The reversal of 151046965 is 569640151.

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

It is not a de Polignac number, because 151046965 - 21 = 151046963 is a prime.

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

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (151046963) 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, 12070 + ... + 21160.

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

Almost surely, 2151046965 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 12419.

The product of its (nonzero) digits is 32400, while the sum is 37.

The square root of 151046965 is about 12290.1165576247. The cubic root of 151046965 is about 532.5626044082.

The spelling of 151046965 in words is "one hundred fifty-one million, forty-six thousand, nine hundred sixty-five".

Divisors: 1 5 3323 9091 16615 45455 30209393 151046965