Search a number
-
+
1120032211021 is a prime number
BaseRepresentation
bin10000010011000111000…
…111110100000001001101
310222001222222012112012021
4100103013013310001031
5121322311221223041
62214311413210141
7143630304466063
oct20230707640115
93861888175167
101120032211021
113a2003a90699
121610a0630951
1381807050389
143c2d1b76033
151e204480cd1
hex104c71f404d

1120032211021 has 2 divisors, whose sum is σ = 1120032211022. Its totient is φ = 1120032211020.

The previous prime is 1120032210989. The next prime is 1120032211033. The reversal of 1120032211021 is 1201122300211.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 799012515625 + 321019695396 = 893875^2 + 566586^2 .

It is a cyclic number.

It is not a de Polignac number, because 1120032211021 - 25 = 1120032210989 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 21120032211021 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 48, while the sum is 16.

Adding to 1120032211021 its reverse (1201122300211), we get a palindrome (2321154511232).

The spelling of 1120032211021 in words is "one trillion, one hundred twenty billion, thirty-two million, two hundred eleven thousand, twenty-one".