Search a number
-
+
100000212121261 is a prime number
BaseRepresentation
bin10110101111001100011101…
…000111101111011010101101
3111010001221000201110101221201
4112233030131013233122231
5101101400413300340021
6552403244021125501
730030530323142464
oct2657143507573255
9433057021411851
10100000212121261
1129954940819001
12b270864859891
1343a4c9708549a
141a9a07106b9db
15b8637d220591
hex5af31d1ef6ad

100000212121261 has 2 divisors, whose sum is σ = 100000212121262. Its totient is φ = 100000212121260.

The previous prime is 100000212121189. The next prime is 100000212121339. The reversal of 100000212121261 is 162121212000001.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 55030714956361 + 44969497164900 = 7418269^2 + 6705930^2 .

It is a cyclic number.

It is not a de Polignac number, because 100000212121261 - 29 = 100000212120749 is a prime.

It is a congruent number.

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

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

Almost surely, 2100000212121261 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 96, while the sum is 19.

Adding to 100000212121261 its reverse (162121212000001), we get a palindrome (262121424121262).

The spelling of 100000212121261 in words is "one hundred trillion, two hundred twelve million, one hundred twenty-one thousand, two hundred sixty-one".