Search a number
-
+
15056555557 = 34943141993
BaseRepresentation
bin11100000010111000…
…01100111000100101
31102212022120021022211
432001130030320211
5221313434234212
610530014123421
71042054416301
oct160134147045
942768507284
1015056555557
11642704004a
122b024b0571
13155c48b294
14a2b946d01
155d1c869a7
hex38170ce25

15056555557 has 4 divisors (see below), whose sum is σ = 15099697900. Its totient is φ = 15013413216.

The previous prime is 15056555543. The next prime is 15056555561. The reversal of 15056555557 is 75555565051.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in 2 ways, for example, as 13272422436 + 1784133121 = 115206^2 + 42239^2 .

It is a cyclic number.

It is not a de Polignac number, because 15056555557 - 27 = 15056555429 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 15056555557.

It is a congruent number.

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

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

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

Almost surely, 215056555557 is an apocalyptic number.

It is an amenable number.

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

15056555557 is an equidigital number, since it uses as much as digits as its factorization.

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

The sum of its prime factors is 43142342.

The product of its (nonzero) digits is 3281250, while the sum is 49.

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

Divisors: 1 349 43141993 15056555557