Search a number
-
+
9485369 is a prime number
BaseRepresentation
bin100100001011…
…110000111001
3122211220110222
4210023300321
54412012434
6535145425
7143424065
oct44136071
918756428
109485369
115399553
123215275
131c7155a
14138caa5
15c7572e
hex90bc39

9485369 has 2 divisors, whose sum is σ = 9485370. Its totient is φ = 9485368.

The previous prime is 9485363. The next prime is 9485383. The reversal of 9485369 is 9635849.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 8410000 + 1075369 = 2900^2 + 1037^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-9485369 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

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

Almost surely, 29485369 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 233280, while the sum is 44.

The square root of 9485369 is about 3079.8326253224. The cubic root of 9485369 is about 211.6823964447.

The spelling of 9485369 in words is "nine million, four hundred eighty-five thousand, three hundred sixty-nine".