Search a number
-
+
10100100110029 is a prime number
BaseRepresentation
bin1001001011111001110011…
…1000010001011011001101
31022202120010100020201012221
42102332130320101123031
52310440001112010104
633251531045455341
72061464616263626
oct222763470213315
938676110221187
1010100100110029
113244479226286
121171573111551
13583587619867
1426cbc15aca4d
15127ad7d54c54
hex92f9ce116cd

10100100110029 has 2 divisors, whose sum is σ = 10100100110030. Its totient is φ = 10100100110028.

The previous prime is 10100100110027. The next prime is 10100100110041. The reversal of 10100100110029 is 92001100100101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 8814949124004 + 1285150986025 = 2968998^2 + 1133645^2 .

It is a cyclic number.

It is not a de Polignac number, because 10100100110029 - 21 = 10100100110027 is a prime.

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

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

It is a congruent number.

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

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

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

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

Almost surely, 210100100110029 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 18, while the sum is 16.

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