Search a number
-
+
15691955053 = 58537268069
BaseRepresentation
bin11101001110101000…
…00011101101101101
31111111121011220120111
432213110003231231
5224114120030203
611113033020021
71063601263045
oct164724035555
944447156514
1015691955053
1167227770a5
12305b254611
131630ccc708
14a8c0a6725
1561c94826d
hex3a7503b6d

15691955053 has 4 divisors (see below), whose sum is σ = 15692281660. Its totient is φ = 15691628448.

The previous prime is 15691954933. The next prime is 15691955093. The reversal of 15691955053 is 35055919651.

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 10645699684 + 5046255369 = 103178^2 + 71037^2 .

It is a cyclic number.

It is not a de Polignac number, because 15691955053 - 29 = 15691954541 is a prime.

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 15691954988 and 15691955006.

It is a congruent number.

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

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

Almost surely, 215691955053 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 326606.

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

The spelling of 15691955053 in words is "fifteen billion, six hundred ninety-one million, nine hundred fifty-five thousand, fifty-three".

Divisors: 1 58537 268069 15691955053