Search a number
-
+
151116364 = 2275397013
BaseRepresentation
bin10010000000111…
…01101001001100
3101112100111200101
421000131221030
5302141210424
622554540444
73513316330
oct1100355114
9345314611
10151116364
1178334a63
1242737724
1325400089
14160d97c0
15d400344
hex901da4c

151116364 has 12 divisors (see below), whose sum is σ = 302232784. Its totient is φ = 64764144.

The previous prime is 151116341. The next prime is 151116373. The reversal of 151116364 is 463611151.

151116364 is an admirable number.

It is a Harshad number since it is a multiple of its sum of digits (28), and also a Moran number because the ratio is a prime number: 5397013 = 151116364 / (1 + 5 + 1 + 1 + 1 + 6 + 3 + 6 + 4).

It is an unprimeable number.

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, 2698479 + ... + 2698534.

Almost surely, 2151116364 is an apocalyptic number.

151116364 is a gapful number since it is divisible by the number (14) formed by its first and last digit.

It is an amenable number.

151116364 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

The product of its digits is 2160, while the sum is 28.

The square root of 151116364 is about 12292.9395996238. The cubic root of 151116364 is about 532.6441544375.

The spelling of 151116364 in words is "one hundred fifty-one million, one hundred sixteen thousand, three hundred sixty-four".

Divisors: 1 2 4 7 14 28 5397013 10794026 21588052 37779091 75558182 151116364