Search a number
-
+
10000022000281 is a prime number
BaseRepresentation
bin1001000110000100111111…
…0000100101001010011001
31022101222210201121222112121
42101201033300211022121
52302320021113002111
633133540252341241
72051322603344125
oct221411760451231
938358721558477
1010000022000281
113205a927a0175
1211560a3174821
13576cc888c241
1426800a018585
151251cbd3b871
hex9184fc25299

10000022000281 has 2 divisors, whose sum is σ = 10000022000282. Its totient is φ = 10000022000280.

The previous prime is 10000022000263. The next prime is 10000022000329. The reversal of 10000022000281 is 18200022000001.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 8700045773056 + 1299976227225 = 2949584^2 + 1140165^2 .

It is a cyclic number.

It is not a de Polignac number, because 10000022000281 - 215 = 10000021967513 is a prime.

It is a super-2 number, since 2×100000220002812 (a number of 27 digits) contains 22 as substring.

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

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

Almost surely, 210000022000281 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 64, while the sum is 16.

Adding to 10000022000281 its reverse (18200022000001), we get a palindrome (28200044000282).

The spelling of 10000022000281 in words is "ten trillion, twenty-two million, two hundred eighty-one", and thus it is an aban number.