Search a number
-
+
1010102031209 is a prime number
BaseRepresentation
bin11101011001011101100…
…01011101001101101001
310120120020202011210010002
432230232301131031221
5113022142104444314
62052011240032345
7132656161413035
oct16545661351551
93516222153102
101010102031209
1135a422299517
121439211626b5
137433815b1bb
1436c63d691c5
151b41d57aade
hexeb2ec5d369

1010102031209 has 2 divisors, whose sum is σ = 1010102031210. Its totient is φ = 1010102031208.

The previous prime is 1010102031161. The next prime is 1010102031229. The reversal of 1010102031209 is 9021302010101.

It is an a-pointer prime, because the next prime (1010102031229) can be obtained adding 1010102031209 to its sum of digits (20).

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 541479637609 + 468622393600 = 735853^2 + 684560^2 .

It is a cyclic number.

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

It is a super-2 number, since 2×10101020312092 (a number of 25 digits) contains 22 as substring.

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

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

Almost surely, 21010102031209 is an apocalyptic number.

It is an amenable number.

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

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

1010102031209 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 20.

The spelling of 1010102031209 in words is "one trillion, ten billion, one hundred two million, thirty-one thousand, two hundred nine".