Search a number
-
+
1033230113021 is a prime number
BaseRepresentation
bin11110000100100010101…
…00000101100011111101
310122202221120202001220202
433002101110011203331
5113412023402104041
62110354231053245
7134435256024011
oct17022124054375
93582846661822
101033230113021
1136921050a717
121482b6811225
1376582913a02
1438019878541
151bd23c3aa9b
hexf0915058fd

1033230113021 has 2 divisors, whose sum is σ = 1033230113022. Its totient is φ = 1033230113020.

The previous prime is 1033230113017. The next prime is 1033230113051. The reversal of 1033230113021 is 1203110323301.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 601732209796 + 431497903225 = 775714^2 + 656885^2 .

It is a cyclic number.

It is not a de Polignac number, because 1033230113021 - 22 = 1033230113017 is a prime.

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

It is a congruent number.

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

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

Almost surely, 21033230113021 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 324, while the sum is 20.

Adding to 1033230113021 its reverse (1203110323301), we get a palindrome (2236340436322).

The spelling of 1033230113021 in words is "one trillion, thirty-three billion, two hundred thirty million, one hundred thirteen thousand, twenty-one".