Search a number
-
+
10002201113951 is a prime number
BaseRepresentation
bin1001000110001101000110…
…1001001111010101011111
31022102012102121000102112022
42101203101221033111133
52302334001441121301
633134540414330355
72051430603453164
oct221432151172537
938365377012468
1010002201113951
113206a00854562
1211565b0ab99bb
13577285189c07
142681755ba06b
151252a82ced1b
hex918d1a4f55f

10002201113951 has 2 divisors, whose sum is σ = 10002201113952. Its totient is φ = 10002201113950.

The previous prime is 10002201113941. The next prime is 10002201113959. The reversal of 10002201113951 is 15931110220001.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 10002201113951 - 230 = 10001127372127 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 210002201113951 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 540, while the sum is 26.

Adding to 10002201113951 its reverse (15931110220001), we get a palindrome (25933311333952).

The spelling of 10002201113951 in words is "ten trillion, two billion, two hundred one million, one hundred thirteen thousand, nine hundred fifty-one".