Search a number
-
+
113620135469 is a prime number
BaseRepresentation
bin110100111010001001…
…0011010111000101101
3101212021101022220122112
41221310102122320231
53330143223313334
6124110225453405
711131420134161
oct1516422327055
9355241286575
10113620135469
1144205671505
121a02b1a1265
13a939509cb9
1456dbcd4ca1
152e4ed354ce
hex1a7449ae2d

113620135469 has 2 divisors, whose sum is σ = 113620135470. Its totient is φ = 113620135468.

The previous prime is 113620135459. The next prime is 113620135507. The reversal of 113620135469 is 964531026311.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 91831423369 + 21788712100 = 303037^2 + 147610^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-113620135469 is a prime.

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (113620135459) 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 as a sum of consecutive naturals, namely, 56810067734 + 56810067735.

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

Almost surely, 2113620135469 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 116640, while the sum is 41.

The spelling of 113620135469 in words is "one hundred thirteen billion, six hundred twenty million, one hundred thirty-five thousand, four hundred sixty-nine".