Search a number
-
+
366490433 is a prime number
BaseRepresentation
bin10101110110000…
…011001101000001
3221112121122100202
4111312003031001
51222310143213
6100211054545
712040055141
oct2566031501
9845548322
10366490433
11178968761
12a28a1455
135ac0b05a
1436960921
1522294b58
hex15d83341

366490433 has 2 divisors, whose sum is σ = 366490434. Its totient is φ = 366490432.

The previous prime is 366490409. The next prime is 366490457. The reversal of 366490433 is 334094663.

It is a balanced prime because it is at equal distance from previous prime (366490409) and next prime (366490457).

It can be written as a sum of positive squares in only one way, i.e., 215003569 + 151486864 = 14663^2 + 12308^2 .

It is a cyclic number.

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

It is a Sophie Germain prime.

It is a Chen prime.

It is a Curzon number.

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

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

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

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

Almost surely, 2366490433 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 139968, while the sum is 38.

The square root of 366490433 is about 19143.9398505114. The cubic root of 366490433 is about 715.6283670328.

The spelling of 366490433 in words is "three hundred sixty-six million, four hundred ninety thousand, four hundred thirty-three".