Search a number
-
+
145601256112369 is a prime number
BaseRepresentation
bin100001000110110001101111…
…001001100100000011110001
3201002112100021212210211201221
4201012301233021210003301
5123041012333031043434
61233400143232425041
742445225600500361
oct4106615711440361
9632470255724657
10145601256112369
11424361672930a2
12143b65ba0a8181
1363321a7741c05
1427d51d1a929a1
1511c7651e9c2b4
hex846c6f2640f1

145601256112369 has 2 divisors, whose sum is σ = 145601256112370. Its totient is φ = 145601256112368.

The previous prime is 145601256112241. The next prime is 145601256112391. The reversal of 145601256112369 is 963211652106541.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 73152440526400 + 72448815585969 = 8552920^2 + 8511687^2 .

It is a cyclic number.

It is not a de Polignac number, because 145601256112369 - 27 = 145601256112241 is a prime.

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

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

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

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

Almost surely, 2145601256112369 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2332800, while the sum is 52.

The spelling of 145601256112369 in words is "one hundred forty-five trillion, six hundred one billion, two hundred fifty-six million, one hundred twelve thousand, three hundred sixty-nine".