Search a number
-
+
151352011 = 1031469437
BaseRepresentation
bin10010000010101…
…11001011001011
3101112210110221001
421001113023023
5302221231021
623003555431
73515320336
oct1101271313
9345713831
10151352011
1178486008
124282bb77
1325483405
141615b61d
15d44a091
hex90572cb

151352011 has 4 divisors (see below), whose sum is σ = 152821552. Its totient is φ = 149882472.

The previous prime is 151352009. The next prime is 151352021. The reversal of 151352011 is 110253151.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 110253151 = 332933119.

It is a cyclic number.

It is not a de Polignac number, because 151352011 - 21 = 151352009 is a prime.

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 151352011.

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

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

Almost surely, 2151352011 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1469540.

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

The square root of 151352011 is about 12302.5205141060. The cubic root of 151352011 is about 532.9208745492.

The spelling of 151352011 in words is "one hundred fifty-one million, three hundred fifty-two thousand, eleven".

Divisors: 1 103 1469437 151352011