Search a number
-
+
102281511024001 is a prime number
BaseRepresentation
bin10111010000011001000101…
…001000011011010110000001
3111102011000110100211010000001
4113100121011020123112001
5101401240013310232001
61001311251050000001
730354411122646601
oct2720310510332601
9442130410733001
10102281511024001
112a654388554a01
12b57aa13116001
13450c149bb321a
141b38647090c01
15bc589bbb6001
hex5d064521b581

102281511024001 has 2 divisors, whose sum is σ = 102281511024002. Its totient is φ = 102281511024000.

The previous prime is 102281511023981. The next prime is 102281511024013. The reversal of 102281511024001 is 100420115182201.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 72754502640625 + 29527008383376 = 8529625^2 + 5433876^2 .

It is a cyclic number.

It is not a de Polignac number, because 102281511024001 - 27 = 102281511023873 is a prime.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 2102281511024001 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1280, while the sum is 28.

The spelling of 102281511024001 in words is "one hundred two trillion, two hundred eighty-one billion, five hundred eleven million, twenty-four thousand, one".