Search a number
-
+
151013367 = 3236174639
BaseRepresentation
bin10010000000001…
…00011111110111
3101112011021101200
421000010133313
5302124411432
622552423543
73512410131
oct1100043767
9345137350
10151013367
117827463a
12426a7bb3
132539522b
14160b0051
15d3cea7c
hex90047f7

151013367 has 12 divisors (see below), whose sum is σ = 218237760. Its totient is φ = 100626048.

The previous prime is 151013299. The next prime is 151013389. The reversal of 151013367 is 763310151.

It is not a de Polignac number, because 151013367 - 28 = 151013111 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2151013367 is an apocalyptic number.

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

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

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

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

The product of its (nonzero) digits is 1890, while the sum is 27.

The square root of 151013367 is about 12288.7496109246. The cubic root of 151013367 is about 532.5231147805.

The spelling of 151013367 in words is "one hundred fifty-one million, thirteen thousand, three hundred sixty-seven".

Divisors: 1 3 9 3617 4639 10851 13917 32553 41751 16779263 50337789 151013367