Search a number
-
+
15056116151 = 292412154259
BaseRepresentation
bin11100000010110101…
…00001100110110111
31102212021201221120112
432001122201212313
5221313331204101
610530000453235
71042050606236
oct160132414667
942767657515
1015056116151
11642686a9aa
122b0231a21b
13155c36628b
14a2b870b1d
155d1beb6bb
hex3816a19b7

15056116151 has 8 divisors (see below), whose sum is σ = 15639927600. Its totient is φ = 14476613760.

The previous prime is 15056116123. The next prime is 15056116217. The reversal of 15056116151 is 15161165051.

15056116151 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

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

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-15056116151 is a prime.

It is a Duffinian number.

It is a congruent number.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1070141 + ... + 1084118.

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

Almost surely, 215056116151 is an apocalyptic number.

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

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

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

The sum of its prime factors is 2154529.

The product of its (nonzero) digits is 4500, while the sum is 32.

The spelling of 15056116151 in words is "fifteen billion, fifty-six million, one hundred sixteen thousand, one hundred fifty-one".

Divisors: 1 29 241 6989 2154259 62473511 519176419 15056116151