Search a number
-
+
145601256112969 is a prime number
BaseRepresentation
bin100001000110110001101111…
…001001100100001101001001
3201002112100021212210212120011
4201012301233021210031021
5123041012333031103334
61233400143232431521
742445225600502206
oct4106615711441511
9632470255725504
10145601256112969
1142436167293598
12143b65ba0a85a1
1363321a7742277
1427d51d1a92cad
1511c7651e9c564
hex846c6f264349

145601256112969 has 2 divisors, whose sum is σ = 145601256112970. Its totient is φ = 145601256112968.

The previous prime is 145601256112931. The next prime is 145601256113011. The reversal of 145601256112969 is 969211652106541.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 126436823714569 + 19164432398400 = 11244413^2 + 4377720^2 .

It is a cyclic number.

It is not a de Polignac number, because 145601256112969 - 215 = 145601256080201 is a prime.

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

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

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

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

Almost surely, 2145601256112969 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 6998400, while the sum is 58.

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