Search a number
-
+
1020125340119 is a prime number
BaseRepresentation
bin11101101100001000011…
…01010110000111010111
310121112010021210122001102
432312010031112013113
5113203204041340434
62100350014220315
7133462441215014
oct16660415260727
93545107718042
101020125340119
113636a6183896
12145859ab469b
1375274919c12
143753523870b
151b8084e007e
hexed843561d7

1020125340119 has 2 divisors, whose sum is σ = 1020125340120. Its totient is φ = 1020125340118.

The previous prime is 1020125340109. The next prime is 1020125340121. The reversal of 1020125340119 is 9110435210201.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 1020125340119 - 228 = 1019856904663 is a prime.

It is a super-4 number, since 4×10201253401194 (a number of 49 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.

It is a Sophie Germain prime.

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

It is a Chen prime.

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

It is a congruent number.

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

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

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

Almost surely, 21020125340119 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 2160, while the sum is 29.

The spelling of 1020125340119 in words is "one trillion, twenty billion, one hundred twenty-five million, three hundred forty thousand, one hundred nineteen".