Search a number
-
+
20102012129 is a prime number
BaseRepresentation
bin10010101110001011…
…000101110011100001
31220212221111000120202
4102232023011303201
5312132103342004
613122411514545
71311101166233
oct225613056341
956787430522
1020102012129
118586075271
123a90158a55
131b84874244
14d89a7c253
157c9bbbb1e
hex4ae2c5ce1

20102012129 has 2 divisors, whose sum is σ = 20102012130. Its totient is φ = 20102012128.

The previous prime is 20102012089. The next prime is 20102012131. The reversal of 20102012129 is 92121020102.

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., 11633779600 + 8468232529 = 107860^2 + 92023^2 .

It is a cyclic number.

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

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

Together with 20102012131, it forms a pair of twin primes.

It is a Chen prime.

It is a self number, because there is not a number n which added to its sum of digits gives 20102012129.

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

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

Almost surely, 220102012129 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 20102012129 in words is "twenty billion, one hundred two million, twelve thousand, one hundred twenty-nine".