Search a number
-
+
69532201011311 is a prime number
BaseRepresentation
bin11111100111101001110100…
…01001000100100001101111
3100010012012202122021220211122
433303310322021010201233
533103203421424330221
6403514352511411155
720434351521602663
oct1763647211044157
9303165678256748
1069532201011311
1120178493852075
12796b981523abb
132ca4b20c47a9c
14132553b10c8a3
15808a5ad57eab
hex3f3d3a24486f

69532201011311 has 2 divisors, whose sum is σ = 69532201011312. Its totient is φ = 69532201011310.

The previous prime is 69532201011209. The next prime is 69532201011323. The reversal of 69532201011311 is 11311010223596.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 69532201011311 - 222 = 69532196817007 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 269532201011311 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 9720, while the sum is 35.

The spelling of 69532201011311 in words is "sixty-nine trillion, five hundred thirty-two billion, two hundred one million, eleven thousand, three hundred eleven".