Search a number
-
+
1059485641 is a prime number
BaseRepresentation
bin111111001001100…
…111011111001001
32201211121110001221
4333021213133021
54132212020031
6253044242041
735153323264
oct7711473711
92654543057
101059485641
114a4063275
122569a0321
1313b666ca6
14a09d3cdb
1563031a11
hex3f2677c9

1059485641 has 2 divisors, whose sum is σ = 1059485642. Its totient is φ = 1059485640.

The previous prime is 1059485629. The next prime is 1059485663. The reversal of 1059485641 is 1465849501.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1056510016 + 2975625 = 32504^2 + 1725^2 .

It is a cyclic number.

It is not a de Polignac number, because 1059485641 - 27 = 1059485513 is a prime.

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

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

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

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

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

Almost surely, 21059485641 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 172800, while the sum is 43.

The square root of 1059485641 is about 32549.7410281557. The cubic root of 1059485641 is about 1019.4478752892.

The spelling of 1059485641 in words is "one billion, fifty-nine million, four hundred eighty-five thousand, six hundred forty-one".