Search a number
-
+
151014047 = 672253941
BaseRepresentation
bin10010000000001…
…00101010011111
3101112011022022212
421000010222133
5302124422142
622552431035
73512412122
oct1100045237
9345138285
10151014047
11782750a8
12426a847b
1325395632
14160b03b9
15d3ced82
hex9004a9f

151014047 has 4 divisors (see below), whose sum is σ = 153268056. Its totient is φ = 148760040.

The previous prime is 151014041. The next prime is 151014091. The reversal of 151014047 is 740410151.

It is a happy number.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-151014047 is a prime.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (151014041) 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 3 ways as a sum of consecutive naturals, for example, 1126904 + ... + 1127037.

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

Almost surely, 2151014047 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2254008.

The product of its (nonzero) digits is 560, while the sum is 23.

The square root of 151014047 is about 12288.7772784765. Note that the first 3 decimals coincide. The cubic root of 151014047 is about 532.5239140810.

Adding to 151014047 its reverse (740410151), we get a palindrome (891424198).

The spelling of 151014047 in words is "one hundred fifty-one million, fourteen thousand, forty-seven".

Divisors: 1 67 2253941 151014047