Search a number
-
+
101213222993 is a prime number
BaseRepresentation
bin101111001000011000…
…1110011100001010001
3100200020201112110022122
41132100301303201101
53124241041113433
6114255142344025
710212105125531
oct1362061634121
9320221473278
10101213222993
1139a19253533
121774812b015
13970cc8377c
144c822334c1
1529759d8198
hex1790c73851

101213222993 has 2 divisors, whose sum is σ = 101213222994. Its totient is φ = 101213222992.

The previous prime is 101213222939. The next prime is 101213223029. The reversal of 101213222993 is 399222312101.

Together with previous prime (101213222939) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 69004459969 + 32208763024 = 262687^2 + 179468^2 .

It is a cyclic number.

It is not a de Polignac number, because 101213222993 - 220 = 101212174417 is a prime.

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

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

Almost surely, 2101213222993 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 11664, while the sum is 35.

The spelling of 101213222993 in words is "one hundred one billion, two hundred thirteen million, two hundred twenty-two thousand, nine hundred ninety-three".