Search a number
-
+
10485637 is a prime number
BaseRepresentation
bin100111111111…
…111110000101
3201201201120221
4213333332011
510141020022
61012424341
7155061241
oct47777605
921651527
1010485637
115a12018
1236180b1
132231926
14156d421
15dc1cc7
hex9fff85

10485637 has 2 divisors, whose sum is σ = 10485638. Its totient is φ = 10485636.

The previous prime is 10485619. The next prime is 10485649. The reversal of 10485637 is 73658401.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 8844676 + 1640961 = 2974^2 + 1281^2 .

It is an emirp because it is prime and its reverse (73658401) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 10485637 - 211 = 10483589 is a prime.

It is equal to p694708 and since 10485637 and 694708 have the same sum of digits, it is a Honaker prime.

It is a congruent number.

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

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

Almost surely, 210485637 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 20160, while the sum is 34.

The square root of 10485637 is about 3238.1533317618. The cubic root of 10485637 is about 218.8760653483.

The spelling of 10485637 in words is "ten million, four hundred eighty-five thousand, six hundred thirty-seven".