Search a number
-
+
110010101100013 is a prime number
BaseRepresentation
bin11001000000110110111000…
…111111110110110111101101
3112102111212022002112211101101
4121000312320333312313231
5103404401141340200023
61025545535345243101
732112652600454662
oct3100667077666755
9472455262484341
10110010101100013
1132064027128134
1210408840333491
13494cba5bc900a
141d2473569da69
15cab9363e11ad
hex640db8ff6ded

110010101100013 has 2 divisors, whose sum is σ = 110010101100014. Its totient is φ = 110010101100012.

The previous prime is 110010101099993. The next prime is 110010101100077. The reversal of 110010101100013 is 310001101010011.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 109289398580649 + 720702519364 = 10454157^2 + 848942^2 .

It is a cyclic number.

It is not a de Polignac number, because 110010101100013 - 25 = 110010101099981 is a prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (110010101190013) 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, 55005050550006 + 55005050550007.

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

Almost surely, 2110010101100013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3, while the sum is 10.

Adding to 110010101100013 its reverse (310001101010011), we get a palindrome (420011202110024).

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