Search a number
-
+
20120110009969 is a prime number
BaseRepresentation
bin1001001001100100101000…
…00000101000111001110001
32122020110112001122012110111
410210302110000220321301
510114121441130304334
6110443015000301321
74144426040200024
oct444622400507161
978213461565414
1020120110009969
116457988630292
12230b4b4171841
13b2c41a207b58
144d7b6603d1bb
1524d58481c064
hex124c94028e71

20120110009969 has 2 divisors, whose sum is σ = 20120110009970. Its totient is φ = 20120110009968.

The previous prime is 20120110009943. The next prime is 20120110009991. The reversal of 20120110009969 is 96990001102102.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 16352221388944 + 3767888621025 = 4043788^2 + 1941105^2 .

It is a cyclic number.

It is not a de Polignac number, because 20120110009969 - 27 = 20120110009841 is a prime.

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

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

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

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

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

Almost surely, 220120110009969 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 17496, while the sum is 40.

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