Search a number
-
+
100021310209297 is a prime number
BaseRepresentation
bin10110101111100000000110…
…101010100011110100010001
3111010010221111002020022210201
4112233200012222203310101
5101102222120403144142
6552421053334255201
730032205211010311
oct2657400652436421
9433127432208721
10100021310209297
11299628880768a4
12b2749724b7501
1343a6c7a0c1749
141a9b0b3115441
15b86bb5595ab7
hex5af806aa3d11

100021310209297 has 2 divisors, whose sum is σ = 100021310209298. Its totient is φ = 100021310209296.

The previous prime is 100021310209279. The next prime is 100021310209321. The reversal of 100021310209297 is 792902013120001.

Together with previous prime (100021310209279) it forms an Ormiston pair, because they use the same digits, order apart.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 81823313549376 + 18197996659921 = 9045624^2 + 4265911^2 .

It is a cyclic number.

It is not a de Polignac number, because 100021310209297 - 27 = 100021310209169 is a prime.

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

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

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

Almost surely, 2100021310209297 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 13608, while the sum is 37.

Adding to 100021310209297 its reverse (792902013120001), we get a palindrome (892923323329298).

The spelling of 100021310209297 in words is "one hundred trillion, twenty-one billion, three hundred ten million, two hundred nine thousand, two hundred ninety-seven".