Search a number
-
+
151111989 = 3272398603
BaseRepresentation
bin10010000000111…
…00100100110101
3101112100021200100
421000130210311
5302141040424
622554504313
73513300510
oct1100344465
9345307610
10151111989
1178331746
1242735099
13253cb0a2
14160d7d77
15d3eddc9
hex901c935

151111989 has 12 divisors (see below), whose sum is σ = 249454816. Its totient is φ = 86349672.

The previous prime is 151111967. The next prime is 151111991. The reversal of 151111989 is 989111151.

It is not a de Polignac number, because 151111989 - 216 = 151046453 is a prime.

It is a super-2 number, since 2×1511119892 = 45669666439072242, which contains 22 as substring.

It is a Duffinian number.

It is a congruent number.

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

Almost surely, 2151111989 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its digits is 3240, while the sum is 36.

The square root of 151111989 is about 12292.7616506626. The cubic root of 151111989 is about 532.6390141588.

It can be divided in two parts, 151111 and 989, that added together give a square (152100 = 3902).

The spelling of 151111989 in words is "one hundred fifty-one million, one hundred eleven thousand, nine hundred eighty-nine".

Divisors: 1 3 7 9 21 63 2398603 7195809 16790221 21587427 50370663 151111989