Search a number
-
+
151111113 = 3172962963
BaseRepresentation
bin10010000000111…
…00010111001001
3101112100020110220
421000130113021
5302141023423
622554500253
73513265116
oct1100342711
9345306426
10151111113
117833101a
1242734689
13253ca87a
14160d790d
15d3ed9e3
hex901c5c9

151111113 has 8 divisors (see below), whose sum is σ = 213333408. Its totient is φ = 94814784.

The previous prime is 151111069. The next prime is 151111187. The reversal of 151111113 is 311111151.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 151111113 - 29 = 151110601 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 151111092 and 151111101.

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

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

Almost surely, 2151111113 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 2962983.

The product of its digits is 15, while the sum is 15.

The square root of 151111113 is about 12292.7260198867. The cubic root of 151111113 is about 532.6379849163.

Adding to 151111113 its reverse (311111151), we get a palindrome (462222264).

The spelling of 151111113 in words is "one hundred fifty-one million, one hundred eleven thousand, one hundred thirteen".

Divisors: 1 3 17 51 2962963 8888889 50370371 151111113