Search a number
-
+
69584956213 is a prime number
BaseRepresentation
bin100000011001110010…
…1100010101100110101
320122121111101000211111
41000303211202230311
52120002222044323
651544503035021
75012244240313
oct1006345425465
9218544330744
1069584956213
1127568991583
121159ba3ba71
13673c469806
1435218570b3
151c23e79c0d
hex1033962b35

69584956213 has 2 divisors, whose sum is σ = 69584956214. Its totient is φ = 69584956212.

The previous prime is 69584956211. The next prime is 69584956277. The reversal of 69584956213 is 31265948596.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 68614135249 + 970820964 = 261943^2 + 31158^2 .

It is a cyclic number.

It is not a de Polignac number, because 69584956213 - 21 = 69584956211 is a prime.

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

Together with 69584956211, it forms a pair of twin primes.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (69584956211) 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, 34792478106 + 34792478107.

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

Almost surely, 269584956213 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 13996800, while the sum is 58.

The spelling of 69584956213 in words is "sixty-nine billion, five hundred eighty-four million, nine hundred fifty-six thousand, two hundred thirteen".