Search a number
-
+
4901960137 is a prime number
BaseRepresentation
bin1001001000010110…
…11111100111001001
3110122121220101011011
410210023133213021
540014400211022
62130230003521
7232321654654
oct44413374711
913577811134
104901960137
112096035228
12b497a65a1
13601753339
1434706089b
151da53c977
hex1242df9c9

4901960137 has 2 divisors, whose sum is σ = 4901960138. Its totient is φ = 4901960136.

The previous prime is 4901960117. The next prime is 4901960197. The reversal of 4901960137 is 7310691094.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 4879860736 + 22099401 = 69856^2 + 4701^2 .

It is a cyclic number.

It is not a de Polignac number, because 4901960137 - 219 = 4901435849 is a prime.

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

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

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

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

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

Almost surely, 24901960137 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 40824, while the sum is 40.

The square root of 4901960137 is about 70013.9995786557. Note that the first 3 decimals coincide. The cubic root of 4901960137 is about 1698.7257044453.

The spelling of 4901960137 in words is "four billion, nine hundred one million, nine hundred sixty thousand, one hundred thirty-seven".