Search a number
-
+
101010110020913 is a prime number
BaseRepresentation
bin10110111101111000111111…
…101110011111110100110001
3111020122110202020112020012202
4112331320333232133310301
5101214422201131132123
6554455223130032545
730163511455513022
oct2675707756376461
9436573666466182
10101010110020913
112a204168862455
12b3b4529578755
13444929bb40982
141ad2cb5c5ac49
15ba27888c7a28
hex5bde3fb9fd31

101010110020913 has 2 divisors, whose sum is σ = 101010110020914. Its totient is φ = 101010110020912.

The previous prime is 101010110020879. The next prime is 101010110021077. The reversal of 101010110020913 is 319020011010101.

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., 88783562785009 + 12226547235904 = 9422503^2 + 3496648^2 .

It is a cyclic number.

It is not a de Polignac number, because 101010110020913 - 28 = 101010110020657 is a prime.

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

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

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

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

Almost surely, 2101010110020913 is an apocalyptic number.

It is an amenable number.

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

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

101010110020913 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 54, while the sum is 20.

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