Search a number
10203022033081 is a prime number
BaseRepresentation
bin1001010001111001001110…
…0000010000000010111001
31100010101210011000010100221
42110132103200100002321
52314131242120024311
633411111551500041
72102100253221343
oct224362340200271
940111704003327
1010203022033081
113284093a44419
1211894b7527621
135901aa5a4847
14273b86710293
1512a60d85e671
hex947938100b9

10203022033081 has 2 divisors, whose sum is σ = 10203022033082. Its totient is φ = 10203022033080.

The previous prime is 10203022033069. The next prime is 10203022033117. The reversal of 10203022033081 is 18033022030201.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 9863996490000 + 339025543081 = 3140700^2 + 582259^2 .

It is a cyclic number.

It is not a de Polignac number, because 10203022033081 - 27 = 10203022032953 is a prime.

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

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

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

Almost surely, 210203022033081 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1728, while the sum is 25.

Adding to 10203022033081 its reverse (18033022030201), we get a palindrome (28236044063282).

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