Search a number
-
+
15104056557 = 338313145393
BaseRepresentation
bin11100001000100010…
…11001110011101101
31102222121221120110010
432010101121303231
5221413114302212
610534432203433
71043202235212
oct160421316355
942877846403
1015104056557
116450934277
122b16399579
131569280095
14a33d8db09
155d601b03c
hex384459ced

15104056557 has 8 divisors (see below), whose sum is σ = 20191325184. Its totient is φ = 10043079488.

The previous prime is 15104056537. The next prime is 15104056619. The reversal of 15104056557 is 75565040151.

It is a happy number.

15104056557 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 not a de Polignac number, because 15104056557 - 28 = 15104056301 is a prime.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (15104056537) 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, 6571548 + ... + 6573845.

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

Almost surely, 215104056557 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 13145779.

The product of its (nonzero) digits is 105000, while the sum is 39.

The spelling of 15104056557 in words is "fifteen billion, one hundred four million, fifty-six thousand, five hundred fifty-seven".

Divisors: 1 3 383 1149 13145393 39436179 5034685519 15104056557