Search a number
-
+
16641430157 = 111512857287
BaseRepresentation
bin11110111111110100…
…00001001010001101
31120221202210020120002
433133322001022031
5233040201231112
611351151334045
71126250552042
oct173772011215
946852706502
1016641430157
11706a720870
123285221325
1317529295c1
14b3c2211c9
15675e991c2
hex3dfe8128d

16641430157 has 4 divisors (see below), whose sum is σ = 18154287456. Its totient is φ = 15128572860.

The previous prime is 16641430153. The next prime is 16641430159. The reversal of 16641430157 is 75103414661.

It is a happy number.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 16641430157 - 22 = 16641430153 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 16641430157.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (16641430153) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 756428633 + ... + 756428654.

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

Almost surely, 216641430157 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1512857298.

The product of its (nonzero) digits is 60480, while the sum is 38.

The spelling of 16641430157 in words is "sixteen billion, six hundred forty-one million, four hundred thirty thousand, one hundred fifty-seven".

Divisors: 1 11 1512857287 16641430157