Search a number
-
+
151076721 = 3472110667
BaseRepresentation
bin10010000000100…
…11111101110001
3101112021111022010
421000103331301
5302133423341
622554033133
73513062625
oct1100237561
9345244263
10151076721
11783081a4
12427187a9
13253b8013
14160c9185
15d3e3716
hex9013f71

151076721 has 8 divisors (see below), whose sum is σ = 201497184. Its totient is φ = 100687040.

The previous prime is 151076707. The next prime is 151076729. The reversal of 151076721 is 127670151.

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 151076721 - 29 = 151076209 is a prime.

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

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

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

Almost surely, 2151076721 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 15391.

The product of its (nonzero) digits is 2940, while the sum is 30.

The square root of 151076721 is about 12291.3270642352. The cubic root of 151076721 is about 532.5975734267.

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

Divisors: 1 3 4721 10667 14163 32001 50358907 151076721