Search a number
-
+
146372159959 is a prime number
BaseRepresentation
bin1000100001010001110…
…1011110100111010111
3111222210221001010220121
42020110131132213113
54344232233104314
6151124211212411
713401144555064
oct2102435364727
9458727033817
10146372159959
11570922a5243
122444b8a7107
1310a58aa254c
147127a35c6b
153c1a36dd24
hex221475e9d7

146372159959 has 2 divisors, whose sum is σ = 146372159960. Its totient is φ = 146372159958.

The previous prime is 146372159957. The next prime is 146372160013. The reversal of 146372159959 is 959951273641.

It is a happy number.

It is a weak prime.

It is an emirp because it is prime and its reverse (959951273641) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 146372159959 - 21 = 146372159957 is a prime.

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

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

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

It is a congruent number.

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

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

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

Almost surely, 2146372159959 is an apocalyptic number.

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

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

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

The product of its digits is 18370800, while the sum is 61.

The spelling of 146372159959 in words is "one hundred forty-six billion, three hundred seventy-two million, one hundred fifty-nine thousand, nine hundred fifty-nine".