Search a number
-
+
69064856730431 is a prime number
BaseRepresentation
bin11111011010000011010100…
…10000000111101100111111
3100001112112110121120121201122
433231001222100013230333
533023024311310333211
6402515542425501155
720355525351010442
oct1755015220075477
9301475417517648
1069064856730431
112000827211a7a1
1278b52949417bb
132c6ca32443643
14130aa84d1b659
157eb8070886db
hex3ed06a407b3f

69064856730431 has 2 divisors, whose sum is σ = 69064856730432. Its totient is φ = 69064856730430.

The previous prime is 69064856730341. The next prime is 69064856730439. The reversal of 69064856730431 is 13403765846096.

Together with previous prime (69064856730341) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 69064856730431 - 218 = 69064856468287 is a prime.

It is a super-3 number, since 3×690648567304313 (a number of 42 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

It is a congruent number.

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

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

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

Almost surely, 269064856730431 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 78382080, while the sum is 62.

The spelling of 69064856730431 in words is "sixty-nine trillion, sixty-four billion, eight hundred fifty-six million, seven hundred thirty thousand, four hundred thirty-one".