Search a number
-
+
113310200220001 is a prime number
BaseRepresentation
bin11001110000111000010110…
…001110111100100101100001
3112212012100102200020221122021
4121300320112032330211201
5104322433242224020001
61040553553134341441
732603251251243121
oct3160702616744541
9485170380227567
10113310200220001
113311664a040454
121086033895a881
134b2c14bc508a5
141dda35893ac81
15d176d1d72ba1
hex670e163bc961

113310200220001 has 2 divisors, whose sum is σ = 113310200220002. Its totient is φ = 113310200220000.

The previous prime is 113310200219941. The next prime is 113310200220043. The reversal of 113310200220001 is 100022002013311.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 62458183496401 + 50852016723600 = 7903049^2 + 7131060^2 .

It is a cyclic number.

It is not a de Polignac number, because 113310200220001 - 211 = 113310200217953 is a prime.

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

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

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

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

Almost surely, 2113310200220001 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 113310200220001 its reverse (100022002013311), we get a palindrome (213332202233312).

The spelling of 113310200220001 in words is "one hundred thirteen trillion, three hundred ten billion, two hundred million, two hundred twenty thousand, one".