Search a number
-
+
101100110001013 is a prime number
BaseRepresentation
bin10110111111001100110100…
…001001001011001101110101
3111020222002001111100221001001
4112333030310021023031311
5101222411011130013023
6555004425510003301
730203145654644404
oct2677146411131565
9436862044327031
10101100110001013
112a23935246a5a2
12b409a66346531
134454912956b76
141ad73b2b5163b
15ba4ca4c4d6ad
hex5bf33424b375

101100110001013 has 2 divisors, whose sum is σ = 101100110001014. Its totient is φ = 101100110001012.

The previous prime is 101100110001001. The next prime is 101100110001047. The reversal of 101100110001013 is 310100011001101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 57267328680324 + 43832781320689 = 7567518^2 + 6620633^2 .

It is a cyclic number.

It is not a de Polignac number, because 101100110001013 - 225 = 101100076446581 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2101100110001013 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 101100110001013 its reverse (310100011001101), we get a palindrome (411200121002114).

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