Search a number
-
+
20559433 is a prime number
BaseRepresentation
bin100111001101…
…1011001001001
31102200112020111
41032123121021
520230400213
62012354321
7336516016
oct116333111
942615214
1020559433
1110672674
126a759a1
13434ac5b
142a3270d
151c11a3d
hex139b649

20559433 has 2 divisors, whose sum is σ = 20559434. Its totient is φ = 20559432.

The previous prime is 20559421. The next prime is 20559437. The reversal of 20559433 is 33495502.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 15116544 + 5442889 = 3888^2 + 2333^2 .

It is a cyclic number.

It is not a de Polignac number, because 20559433 - 213 = 20551241 is a prime.

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

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

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

Almost surely, 220559433 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 20559433 is about 4534.2510958261. The cubic root of 20559433 is about 273.9494152449.

The spelling of 20559433 in words is "twenty million, five hundred fifty-nine thousand, four hundred thirty-three".