Base | Representation |
---|---|
bin | 1001001001100100101000… |
… | …00000101000111001110001 |
3 | 2122020110112001122012110111 |
4 | 10210302110000220321301 |
5 | 10114121441130304334 |
6 | 110443015000301321 |
7 | 4144426040200024 |
oct | 444622400507161 |
9 | 78213461565414 |
10 | 20120110009969 |
11 | 6457988630292 |
12 | 230b4b4171841 |
13 | b2c41a207b58 |
14 | 4d7b6603d1bb |
15 | 24d58481c064 |
hex | 124c94028e71 |
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".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •