Search a number
-
+
23593193068469 is a prime number
BaseRepresentation
bin1010101110101001101111…
…11001000101011110110101
310002112111011012010212221212
411113110313321011132311
511043022324411142334
6122102321355451205
74653360214122413
oct527246771053665
9102474135125855
1023593193068469
1175768a9460962
122790628756b05
131021aa04664ab
145b7cb93782b3
152adaa6a68ece
hex157537e457b5

23593193068469 has 2 divisors, whose sum is σ = 23593193068470. Its totient is φ = 23593193068468.

The previous prime is 23593193068463. The next prime is 23593193068483. The reversal of 23593193068469 is 96486039139532.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 20053290048100 + 3539903020369 = 4478090^2 + 1881463^2 .

It is a cyclic number.

It is not a de Polignac number, because 23593193068469 - 24 = 23593193068453 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 23593193068399 and 23593193068408.

It is a congruent number.

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

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

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

Almost surely, 223593193068469 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 226748160, while the sum is 68.

The spelling of 23593193068469 in words is "twenty-three trillion, five hundred ninety-three billion, one hundred ninety-three million, sixty-eight thousand, four hundred sixty-nine".