Search a number
-
+
101330022022013 is a prime number
BaseRepresentation
bin10111000010100010111011…
…111101111011101101111101
3111021210001111110101201102002
4113002202323331323231331
5101240142341114201023
6555302211450312045
730225565256612621
oct2702427375735575
9437701443351362
10101330022022013
112a317903843904
12b44652b428625
1344704c3046045
141b045836d9181
15baac5e21db28
hex5c28bbf7bb7d

101330022022013 has 2 divisors, whose sum is σ = 101330022022014. Its totient is φ = 101330022022012.

The previous prime is 101330022021983. The next prime is 101330022022049. The reversal of 101330022022013 is 310220220033101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 78775529811364 + 22554492210649 = 8875558^2 + 4749157^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-101330022022013 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 2101330022022013 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 101330022022013 its reverse (310220220033101), we get a palindrome (411550242055114).

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