Search a number
-
+
1010223213101 is a prime number
BaseRepresentation
bin11101011001101011111…
…11101110101000101101
310120120120012012110102022
432230311333232220231
5113022414120304401
62052031245235525
7132662162426024
oct16546577565055
93516505173368
101010223213101
1135a484738243
12143955862ba5
13743572aa06b
1436c760b18bb
151b42901671b
hexeb35feea2d

1010223213101 has 2 divisors, whose sum is σ = 1010223213102. Its totient is φ = 1010223213100.

The previous prime is 1010223213049. The next prime is 1010223213107. The reversal of 1010223213101 is 1013123220101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 728463957001 + 281759256100 = 853501^2 + 530810^2 .

It is an emirp because it is prime and its reverse (1013123220101) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 1010223213101 - 222 = 1010219018797 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 1010223213101.

It is a congruent number.

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

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

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

Almost surely, 21010223213101 is an apocalyptic number.

It is an amenable number.

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

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

1010223213101 is an evil number, because the sum of its binary digits is even.

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

Adding to 1010223213101 its reverse (1013123220101), we get a palindrome (2023346433202).

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