Search a number
-
+
10230221031113 is a prime number
BaseRepresentation
bin1001010011011110100010…
…1100001100011011001001
31100012222222200201101101102
42110313220230030123021
52320102443040443423
633431410524431145
72104052261666606
oct224675054143311
940188880641342
1010230221031113
113294681086196
1211928283a84b5
1359292357b615
14275206b536ad
1512b1a1601c28
hex94de8b0c6c9

10230221031113 has 2 divisors, whose sum is σ = 10230221031114. Its totient is φ = 10230221031112.

The previous prime is 10230221031071. The next prime is 10230221031133. The reversal of 10230221031113 is 31113012203201.

It is a happy number.

It is an a-pointer prime, because the next prime (10230221031133) can be obtained adding 10230221031113 to its sum of digits (20).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 9439131748489 + 791089282624 = 3072317^2 + 889432^2 .

It is a cyclic number.

It is not a de Polignac number, because 10230221031113 - 210 = 10230221030089 is a prime.

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

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

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

Almost surely, 210230221031113 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 10230221031113 its reverse (31113012203201), we get a palindrome (41343233234314).

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