Search a number
-
+
10113220012969 is a prime number
BaseRepresentation
bin1001001100101010101011…
…1000101110101110101001
31022210210222200122211121001
42103022222320232232221
52311143333310403334
633301541002515001
72062441006516543
oct223125270565651
938723880584531
1010113220012969
113249aa1056577
121174014b05a61
135848987b0238
1426d6a7c2a693
15128104a8d714
hex932aae2eba9

10113220012969 has 2 divisors, whose sum is σ = 10113220012970. Its totient is φ = 10113220012968.

The previous prime is 10113220012921. The next prime is 10113220013027. The reversal of 10113220012969 is 96921002231101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 8600799674944 + 1512420338025 = 2932712^2 + 1229805^2 .

It is a cyclic number.

It is not a de Polignac number, because 10113220012969 - 225 = 10113186458537 is a prime.

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

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

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

Almost surely, 210113220012969 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 10113220012969 in words is "ten trillion, one hundred thirteen billion, two hundred twenty million, twelve thousand, nine hundred sixty-nine".