Search a number
-
+
102133201013 is a prime number
BaseRepresentation
bin101111100011110011…
…1001111100001110101
3100202121211122011220122
41133013213033201311
53133132044413023
6114530324541325
710243645612304
oct1370747174165
9322554564818
10102133201013
113a350590648
1217964251845
13982875356c
144d2c4b043b
1529cb65e2c8
hex17c79cf875

102133201013 has 2 divisors, whose sum is σ = 102133201014. Its totient is φ = 102133201012.

The previous prime is 102133200937. The next prime is 102133201033. The reversal of 102133201013 is 310102331201.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 92986573969 + 9146627044 = 304937^2 + 95638^2 .

It is a cyclic number.

It is not a de Polignac number, because 102133201013 - 222 = 102129006709 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

It is a junction number, because it is equal to n+sod(n) for n = 102133200982 and 102133201000.

It is a congruent number.

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

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

Almost surely, 2102133201013 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 102133201013 its reverse (310102331201), we get a palindrome (412235532214).

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