Search a number
-
+
120102111013 is a prime number
BaseRepresentation
bin110111111011010100…
…1001100011100100101
3102111000010022101110211
41233312221030130211
53431432120023023
6131101341015421
711451146046103
oct1576651143445
9374003271424
10120102111013
1146a31568695
121b339b54571
13b4303b99a1
145b54b26c73
1531cde25a0d
hex1bf6a4c725

120102111013 has 2 divisors, whose sum is σ = 120102111014. Its totient is φ = 120102111012.

The previous prime is 120102111011. The next prime is 120102111023. The reversal of 120102111013 is 310111201021.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 71720589249 + 48381521764 = 267807^2 + 219958^2 .

It is a cyclic number.

It is not a de Polignac number, because 120102111013 - 21 = 120102111011 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 2120102111013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 12, while the sum is 13.

Adding to 120102111013 its reverse (310111201021), we get a palindrome (430213312034).

The spelling of 120102111013 in words is "one hundred twenty billion, one hundred two million, one hundred eleven thousand, thirteen".