Search a number
-
+
1048939553 is a prime number
BaseRepresentation
bin111110100001011…
…000110000100001
32201002202122120002
4332201120300201
54122012031203
6252030225345
734664560544
oct7641306041
92632678502
101048939553
1149910a8a2
12253355255
131394139bc
149d44a85b
156214bd88
hex3e858c21

1048939553 has 2 divisors, whose sum is σ = 1048939554. Its totient is φ = 1048939552.

The previous prime is 1048939523. The next prime is 1048939579. The reversal of 1048939553 is 3559398401.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 771283984 + 277655569 = 27772^2 + 16663^2 .

It is a cyclic number.

It is not a de Polignac number, because 1048939553 - 222 = 1044745249 is a prime.

It is a super-3 number, since 3×10489395533 (a number of 28 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

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

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

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

Almost surely, 21048939553 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 583200, while the sum is 47.

The square root of 1048939553 is about 32387.3363060317. The cubic root of 1048939553 is about 1016.0540718866.

The spelling of 1048939553 in words is "one billion, forty-eight million, nine hundred thirty-nine thousand, five hundred fifty-three".