Search a number
-
+
146147739139 is a prime number
BaseRepresentation
bin1000100000011100010…
…1011000011000000011
3111222020021202101102101
42020013011120120003
54343302310123024
6151050033131231
713362451200013
oct2100705303003
9458207671371
10146147739139
1156a87652596
12243a86b9b17
1310a2144786c
147105cd7c43
153c057ddc44
hex2207158603

146147739139 has 2 divisors, whose sum is σ = 146147739140. Its totient is φ = 146147739138.

The previous prime is 146147739097. The next prime is 146147739193. The reversal of 146147739139 is 931937741641.

Together with next prime (146147739193) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 146147739139 - 27 = 146147739011 is a prime.

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

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

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

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

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

Almost surely, 2146147739139 is an apocalyptic number.

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

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

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

The product of its digits is 3429216, while the sum is 55.

The spelling of 146147739139 in words is "one hundred forty-six billion, one hundred forty-seven million, seven hundred thirty-nine thousand, one hundred thirty-nine".