Search a number
-
+
101110012100029 is a prime number
BaseRepresentation
bin10110111111010110000010…
…010110101011110110111101
3111021000000121120220200021001
4112333112002112223312331
5101223041301044200104
6555013144234210301
730203646233255632
oct2677260226536675
9437000546820231
10101110012100029
112a2425739970a9
12b40b96a583991
13445583028705a
141ad7a71cac189
15ba518421daa4
hex5bf5825abdbd

101110012100029 has 2 divisors, whose sum is σ = 101110012100030. Its totient is φ = 101110012100028.

The previous prime is 101110012099949. The next prime is 101110012100033. The reversal of 101110012100029 is 920001210011101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 73434016503225 + 27675995596804 = 8569365^2 + 5260798^2 .

It is a cyclic number.

It is not a de Polignac number, because 101110012100029 - 221 = 101110010002877 is a prime.

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

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (29) of ones.

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

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

Almost surely, 2101110012100029 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 36, while the sum is 19.

The spelling of 101110012100029 in words is "one hundred one trillion, one hundred ten billion, twelve million, one hundred thousand, twenty-nine".