Search a number
-
+
145676150072147 is a prime number
BaseRepresentation
bin100001000111110111011111…
…001011010110001101010011
3201002210111121101000012100002
4201013313133023112031103
5123043224223404302042
61233454411030120215
742453516541604342
oct4107673713261523
9632714541005302
10145676150072147
11424649a9a45622
121440901bab006b
136339281a6b246
1427d8a98645b59
1511c958706a132
hex847ddf2d6353

145676150072147 has 2 divisors, whose sum is σ = 145676150072148. Its totient is φ = 145676150072146.

The previous prime is 145676150072143. The next prime is 145676150072203. The reversal of 145676150072147 is 741270051676541.

It is an a-pointer prime, because the next prime (145676150072203) can be obtained adding 145676150072147 to its sum of digits (56).

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 145676150072147 - 22 = 145676150072143 is a prime.

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

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

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

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

Almost surely, 2145676150072147 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 9878400, while the sum is 56.

The spelling of 145676150072147 in words is "one hundred forty-five trillion, six hundred seventy-six billion, one hundred fifty million, seventy-two thousand, one hundred forty-seven".