Search a number
-
+
100215121525313 is a prime number
BaseRepresentation
bin10110110010010100100110…
…101110000011101001000001
3111010211110202010102021212012
4112302110212232003221001
5101113411032102302223
6553050105151342305
730052206064012004
oct2662244656035101
9433743663367765
10100215121525313
1129a27aa3553133
12b2a6441521995
1343bc326220422
141aa661b30d53b
15b8bc5a560c78
hex5b2526b83a41

100215121525313 has 2 divisors, whose sum is σ = 100215121525314. Its totient is φ = 100215121525312.

The previous prime is 100215121525283. The next prime is 100215121525361. The reversal of 100215121525313 is 313525121512001.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 94366303349824 + 5848818175489 = 9714232^2 + 2418433^2 .

It is a cyclic number.

It is not a de Polignac number, because 100215121525313 - 236 = 100146402048577 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 100215121525313.

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

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

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

Almost surely, 2100215121525313 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 9000, while the sum is 32.

The spelling of 100215121525313 in words is "one hundred trillion, two hundred fifteen billion, one hundred twenty-one million, five hundred twenty-five thousand, three hundred thirteen".