Search a number
-
+
50105151001 is a prime number
BaseRepresentation
bin101110101010011111…
…111110111000011001
311210022220200101200101
4232222133332320121
51310103404313001
635003515135401
73422436520303
oct565237767031
9153286611611
1050105151001
111a282062604
129864144561
134956797c59
1425d46a2973
151483c15a01
hexbaa7fee19

50105151001 has 2 divisors, whose sum is σ = 50105151002. Its totient is φ = 50105151000.

The previous prime is 50105150987. The next prime is 50105151007. The reversal of 50105151001 is 10015150105.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 28942175376 + 21162975625 = 170124^2 + 145475^2 .

It is a cyclic number.

It is not a de Polignac number, because 50105151001 - 215 = 50105118233 is a prime.

It is a super-2 number, since 2×501051510012 (a number of 22 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 50105151001.

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

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

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

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

Almost surely, 250105151001 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 125, while the sum is 19.

The spelling of 50105151001 in words is "fifty billion, one hundred five million, one hundred fifty-one thousand, one".