Search a number
-
+
1005556064221 is a prime number
BaseRepresentation
bin11101010000111111100…
…11111101111111011101
310120010111221010201202101
432220133303331333131
5112433334323023341
62045540204125101
7132435421343002
oct16503763757735
93503457121671
101005556064221
113584aa202205
12142a72836791
1373a923abbc7
14369522d58a9
151b25440c831
hexea1fcfdfdd

1005556064221 has 2 divisors, whose sum is σ = 1005556064222. Its totient is φ = 1005556064220.

The previous prime is 1005556064213. The next prime is 1005556064287. The reversal of 1005556064221 is 1224606555001.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 893996724196 + 111559340025 = 945514^2 + 334005^2 .

It is a cyclic number.

It is not a de Polignac number, because 1005556064221 - 23 = 1005556064213 is a prime.

It is a super-2 number, since 2×10055560642212 (a number of 25 digits) contains 22 as substring.

It is a congruent number.

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

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

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

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

Almost surely, 21005556064221 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 72000, while the sum is 37.

The spelling of 1005556064221 in words is "one trillion, five billion, five hundred fifty-six million, sixty-four thousand, two hundred twenty-one".