Search a number
-
+
115016134613 is a prime number
BaseRepresentation
bin110101100011101111…
…1101110111111010101
3101222212200011000110112
41223013133232333111
53341023112301423
6124500534532405
711211131004422
oct1530737567725
9358780130415
10115016134613
1144861678306
121a35a807105
13aacc7b76b3
1457d1484d49
152ed2689a78
hex1ac77eefd5

115016134613 has 2 divisors, whose sum is σ = 115016134614. Its totient is φ = 115016134612.

The previous prime is 115016134579. The next prime is 115016134669. The reversal of 115016134613 is 316431610511.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 94515049489 + 20501085124 = 307433^2 + 143182^2 .

It is a cyclic number.

It is not a de Polignac number, because 115016134613 - 220 = 115015086037 is a prime.

It is a super-2 number, since 2×1150161346132 (a number of 23 digits) contains 22 as substring.

It is a self number, because there is not a number n which added to its sum of digits gives 115016134613.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (115016134693) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 57508067306 + 57508067307.

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

Almost surely, 2115016134613 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 115016134613 in words is "one hundred fifteen billion, sixteen million, one hundred thirty-four thousand, six hundred thirteen".