Search a number
-
+
1014910537 is a prime number
BaseRepresentation
bin111100011111100…
…100111001001001
32121201201210112011
4330133210321021
54034304114122
6244413015521
734102411564
oct7437447111
92551653464
101014910537
11480988343
12243a845a1
1313235aba4
1498b0d4db
155e179377
hex3c7e4e49

1014910537 has 2 divisors, whose sum is σ = 1014910538. Its totient is φ = 1014910536.

The previous prime is 1014910511. The next prime is 1014910571. The reversal of 1014910537 is 7350194101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 763085376 + 251825161 = 27624^2 + 15869^2 .

It is a cyclic number.

It is not a de Polignac number, because 1014910537 - 219 = 1014386249 is a prime.

It is a super-2 number, since 2×10149105372 = 2060086796227256738, which contains 22 as substring.

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

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

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

Almost surely, 21014910537 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 1014910537 is about 31857.6605701046. The cubic root of 1014910537 is about 1004.9456789365.

The spelling of 1014910537 in words is "one billion, fourteen million, nine hundred ten thousand, five hundred thirty-seven".