Search a number
-
+
50145141223 is a prime number
BaseRepresentation
bin101110101100111000…
…100010000111100111
311210102200221002221201
4232230320202013213
51310144124004343
635011504223331
73423433445002
oct565470420747
9153380832851
1050145141223
111a2a2696881
12987560ab47
134961b5a1c8
1425d9b12539
1514874b494d
hexbace221e7

50145141223 has 2 divisors, whose sum is σ = 50145141224. Its totient is φ = 50145141222.

The previous prime is 50145141187. The next prime is 50145141251. The reversal of 50145141223 is 32214154105.

It is an a-pointer prime, because the next prime (50145141251) can be obtained adding 50145141223 to its sum of digits (28).

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 50145141223 - 29 = 50145140711 is a prime.

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

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

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (50145141283) 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, 25072570611 + 25072570612.

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

Almost surely, 250145141223 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 4800, while the sum is 28.

Adding to 50145141223 its reverse (32214154105), we get a palindrome (82359295328).

The spelling of 50145141223 in words is "fifty billion, one hundred forty-five million, one hundred forty-one thousand, two hundred twenty-three".