Base | Representation |
---|---|
bin | 1001001001000001011100… |
… | …00101011011010110100001 |
3 | 2122011122202120222100211221 |
4 | 10210200232011123112201 |
5 | 10113314244322314334 |
6 | 110430212324335041 |
7 | 4143156654604312 |
oct | 444405605332641 |
9 | 78148676870757 |
10 | 20101220119969 |
11 | 644a9747a134a |
12 | 2307901b44481 |
13 | b2a6c9810851 |
14 | 4d6c93368609 |
15 | 24cd2b2828b4 |
hex | 12482e15b5a1 |
20101220119969 has 2 divisors, whose sum is σ = 20101220119970. Its totient is φ = 20101220119968.
The previous prime is 20101220119843. The next prime is 20101220120011. The reversal of 20101220119969 is 96991102210102.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10358175801744 + 9743044318225 = 3218412^2 + 3121385^2 .
It is a cyclic number.
It is not a de Polignac number, because 20101220119969 - 29 = 20101220119457 is a prime.
It is a super-2 number, since 2×201012201199692 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (20101220119069) 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, 10050610059984 + 10050610059985.
It is an arithmetic number, because the mean of its divisors is an integer number (10050610059985).
Almost surely, 220101220119969 is an apocalyptic number.
It is an amenable number.
20101220119969 is a deficient number, since it is larger than the sum of its proper divisors (1).
20101220119969 is an equidigital number, since it uses as much as digits as its factorization.
20101220119969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34992, while the sum is 43.
The spelling of 20101220119969 in words is "twenty trillion, one hundred one billion, two hundred twenty million, one hundred nineteen thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •