Search a number
-
+
1005046204433 is a prime number
BaseRepresentation
bin11101010000000010110…
…11000000100000010001
310120002012101202011121112
432220001123000200101
5112431313312020213
62045413432103105
7132416660532215
oct16500133004021
93502171664545
101005046204433
11358268420a87
1214294bb34a95
1373a1088401b
14369046d4945
151b224797ea8
hexea016c0811

1005046204433 has 2 divisors, whose sum is σ = 1005046204434. Its totient is φ = 1005046204432.

The previous prime is 1005046204427. The next prime is 1005046204457. The reversal of 1005046204433 is 3344026405001.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 868348149904 + 136698054529 = 931852^2 + 369727^2 .

It is a cyclic number.

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

It is a Sophie Germain prime.

It is a Curzon number.

It is a self number, because there is not a number n which added to its sum of digits gives 1005046204433.

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

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

Almost surely, 21005046204433 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 34560, while the sum is 32.

The spelling of 1005046204433 in words is "one trillion, five billion, forty-six million, two hundred four thousand, four hundred thirty-three".