Search a number
-
+
113465101669 is a prime number
BaseRepresentation
bin110100110101100001…
…1000000110101100101
3101211212120121101020221
41221223003000311211
53324334031223134
6124043010524341
711124525310453
oct1515303006545
9354776541227
10113465101669
11441361012a7
1219ba72966b1
13a913367b1a
1456c54999d3
152e4140e5b4
hex1a6b0c0d65

113465101669 has 2 divisors, whose sum is σ = 113465101670. Its totient is φ = 113465101668.

The previous prime is 113465101663. The next prime is 113465101709. The reversal of 113465101669 is 966101564311.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 70060796100 + 43404305569 = 264690^2 + 208337^2 .

It is a cyclic number.

It is not a de Polignac number, because 113465101669 - 25 = 113465101637 is a prime.

It is a super-2 number, since 2×1134651016692 (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 (113465101663) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 2113465101669 is an apocalyptic number.

It is an amenable number.

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

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

113465101669 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 43.

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