Search a number
-
+
101110012119931 is a prime number
BaseRepresentation
bin10110111111010110000010…
…010110110000101101111011
3111021000000121120221200120011
4112333112002112300231323
5101223041301100314211
6555013144234442351
730203646233400643
oct2677260226605573
9437000546850504
10101110012119931
112a242573a00051
12b40b96a5933b7
134455830293129
141ad7a71cb5523
15ba5184224921
hex5bf5825b0b7b

101110012119931 has 2 divisors, whose sum is σ = 101110012119932. Its totient is φ = 101110012119930.

The previous prime is 101110012119913. The next prime is 101110012120049. The reversal of 101110012119931 is 139911210011101.

Together with previous prime (101110012119913) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 101110012119931 - 27 = 101110012119803 is a prime.

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

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

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

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

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

Almost surely, 2101110012119931 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 486, while the sum is 31.

The spelling of 101110012119931 in words is "one hundred one trillion, one hundred ten billion, twelve million, one hundred nineteen thousand, nine hundred thirty-one".