Search a number
-
+
13115059397 = 111192278127
BaseRepresentation
bin11000011011011011…
…11110110011000101
31020212000022001021122
430031231332303011
5203324423400042
610005221123325
7643001110526
oct141555766305
936760261248
1013115059397
115620122270
122660259545
131310188b9b
148c5b5a84d
1551b5cd7d2
hex30db7ecc5

13115059397 has 4 divisors (see below), whose sum is σ = 14307337536. Its totient is φ = 11922781260.

The previous prime is 13115059369. The next prime is 13115059409. The reversal of 13115059397 is 79395051131.

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 13115059397 - 222 = 13110865093 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 (13115059327) 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, 596139053 + ... + 596139074.

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

Almost surely, 213115059397 is an apocalyptic number.

It is an amenable number.

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

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

13115059397 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 1192278138.

The product of its (nonzero) digits is 127575, while the sum is 44.

Adding to 13115059397 its sum of digits (44), we get a square (13115059441 = 1145212).

The spelling of 13115059397 in words is "thirteen billion, one hundred fifteen million, fifty-nine thousand, three hundred ninety-seven".

Divisors: 1 11 1192278127 13115059397