Search a number
-
+
103102213020049 is a prime number
BaseRepresentation
bin10111011100010101011010…
…110010000101100110010001
3111112001110211111102012210001
4113130111122302011212101
5102003211313013120144
61003140300334010001
730500613644552335
oct2734253262054621
9445043744365701
10103102213020049
112a940448420741
12b691a96646901
13456b65cac52a9
141b66260a357c5
15bdbdd268cbd4
hex5dc55ac85991

103102213020049 has 2 divisors, whose sum is σ = 103102213020050. Its totient is φ = 103102213020048.

The previous prime is 103102213019903. The next prime is 103102213020133. The reversal of 103102213020049 is 940020312201301.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 52150712187025 + 50951500833024 = 7221545^2 + 7138032^2 .

It is a cyclic number.

It is not a de Polignac number, because 103102213020049 - 29 = 103102213019537 is a prime.

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

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

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

Almost surely, 2103102213020049 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2592, while the sum is 28.

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