Search a number
-
+
101100200102261 is a prime number
BaseRepresentation
bin10110111111001100111001…
…100000111000100101110101
3111020222002021202220112201022
4112333030321200320211311
5101222411202211233021
6555004442445110525
730203151130541303
oct2677147140704565
9436862252815638
10101100200102261
112a23939930aa38
12b409a90558445
134454928512c09
141ad73c0ac7273
15ba4cacaea1ab
hex5bf339838975

101100200102261 has 2 divisors, whose sum is σ = 101100200102262. Its totient is φ = 101100200102260.

The previous prime is 101100200102203. The next prime is 101100200102273. The reversal of 101100200102261 is 162201002001101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 51462961665361 + 49637238436900 = 7173769^2 + 7045370^2 .

It is a cyclic number.

It is not a de Polignac number, because 101100200102261 - 230 = 101099126360437 is a prime.

It is a super-2 number, since 2×1011002001022612 (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 (101100200102201) by changing a digit.

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

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

Almost surely, 2101100200102261 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 48, while the sum is 17.

Adding to 101100200102261 its reverse (162201002001101), we get a palindrome (263301202103362).

The spelling of 101100200102261 in words is "one hundred one trillion, one hundred billion, two hundred million, one hundred two thousand, two hundred sixty-one".