Search a number
-
+
100490737 is a prime number
BaseRepresentation
bin1011111110101…
…01110111110001
321000002110101011
411333111313301
5201211200422
613545510521
72330104624
oct577256761
9230073334
10100490737
11517a71a6
12297a2441
1317a85c99
14d4bbdbb
158c50077
hex5fd5df1

100490737 has 2 divisors, whose sum is σ = 100490738. Its totient is φ = 100490736.

The previous prime is 100490717. The next prime is 100490743. The reversal of 100490737 is 737094001.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 60155536 + 40335201 = 7756^2 + 6351^2 .

It is a cyclic number.

It is not a de Polignac number, because 100490737 - 27 = 100490609 is a prime.

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

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

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

Almost surely, 2100490737 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5292, while the sum is 31.

The square root of 100490737 is about 10024.5068207867. The cubic root of 100490737 is about 464.9169111957.

The spelling of 100490737 in words is "one hundred million, four hundred ninety thousand, seven hundred thirty-seven".