Search a number
-
+
146256968951 is a prime number
BaseRepresentation
bin1000100000110110011…
…0000011110011110111
3111222111220021211112222
42020031212003303313
54344013241001301
6151104534232555
713365245503202
oct2101546036367
9458456254488
10146256968951
1157033278565
12244191b575b
1310a3ac704a2
14711660c939
153c101b831b
hex220d983cf7

146256968951 has 2 divisors, whose sum is σ = 146256968952. Its totient is φ = 146256968950.

The previous prime is 146256968861. The next prime is 146256968983. The reversal of 146256968951 is 159869652641.

146256968951 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 146256968951 - 226 = 146189860087 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 2146256968951 is an apocalyptic number.

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

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

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

The product of its digits is 27993600, while the sum is 62.

The spelling of 146256968951 in words is "one hundred forty-six billion, two hundred fifty-six million, nine hundred sixty-eight thousand, nine hundred fifty-one".