Search a number
-
+
146151606959 is a prime number
BaseRepresentation
bin1000100000011101010…
…0001000101010101111
3111222020120000220001222
42020013110020222233
54343304302410314
6151050252053555
713362526106321
oct2100724105257
9458216026058
10146151606959
1156a89854536
12243a9a642bb
1310a221a0207
147106623611
153c05d04c8e
hex2207508aaf

146151606959 has 2 divisors, whose sum is σ = 146151606960. Its totient is φ = 146151606958.

The previous prime is 146151606949. The next prime is 146151606961. The reversal of 146151606959 is 959606151641.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 146151606959 - 28 = 146151606703 is a prime.

It is a Sophie Germain prime.

Together with 146151606961, it forms a pair of twin primes.

It is a Chen prime.

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

It is a congruent number.

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

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

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

Almost surely, 2146151606959 is an apocalyptic number.

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

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

146151606959 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 1749600, while the sum is 53.

The spelling of 146151606959 in words is "one hundred forty-six billion, one hundred fifty-one million, six hundred six thousand, nine hundred fifty-nine".