Search a number
-
+
23567681064259 is a prime number
BaseRepresentation
bin1010101101111010001110…
…10000100000110101000011
310002110001022012210210102001
411112331013100200311003
511042113102323024014
6122042502045004431
74651465051506403
oct526750720406503
9102401265723361
1023567681064259
117566aa7609562
1227876a8853717
13101c565b34007
145b6978dd2803
152ad0b1e5b974
hex156f47420d43

23567681064259 has 2 divisors, whose sum is σ = 23567681064260. Its totient is φ = 23567681064258.

The previous prime is 23567681064217. The next prime is 23567681064283. The reversal of 23567681064259 is 95246018676532.

It is a happy number.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 23567681064259 - 213 = 23567681056067 is a prime.

It is a super-4 number, since 4×235676810642594 (a number of 55 digits) contains 4444 as substring.

It is a self number, because there is not a number n which added to its sum of digits gives 23567681064259.

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

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

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

It is a 1-persistent number, because it is pandigital, but 2⋅23567681064259 = 47135362128518 is not.

Almost surely, 223567681064259 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 130636800, while the sum is 64.

The spelling of 23567681064259 in words is "twenty-three trillion, five hundred sixty-seven billion, six hundred eighty-one million, sixty-four thousand, two hundred fifty-nine".