Base | Representation |
---|---|
bin | 1001001001000001011100… |
… | …00101011011011000101001 |
3 | 2122011122202120222101000222 |
4 | 10210200232011123120221 |
5 | 10113314244322320410 |
6 | 110430212324335425 |
7 | 4143156654604565 |
oct | 444405605333051 |
9 | 78148676871028 |
10 | 20101220120105 |
11 | 644a9747a1463 |
12 | 2307901b44575 |
13 | b2a6c9810927 |
14 | 4d6c933686a5 |
15 | 24cd2b282955 |
hex | 12482e15b629 |
20101220120105 has 8 divisors (see below), whose sum is σ = 24269448587712. Its totient is φ = 15982319800368.
The previous prime is 20101220120041. The next prime is 20101220120171. The reversal of 20101220120105 is 50102102210102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20101220120105 - 26 = 20101220120041 is a prime.
It is a super-2 number, since 2×201012201201052 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
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 in 7 ways as a sum of consecutive naturals, for example, 12332036069 + ... + 12332037698.
It is an arithmetic number, because the mean of its divisors is an integer number (3033681073464).
Almost surely, 220101220120105 is an apocalyptic number.
It is an amenable number.
20101220120105 is a deficient number, since it is larger than the sum of its proper divisors (4168228467607).
20101220120105 is a wasteful number, since it uses less digits than its factorization.
20101220120105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24664073935.
The product of its (nonzero) digits is 80, while the sum is 17.
Adding to 20101220120105 its reverse (50102102210102), we get a palindrome (70203322330207).
The spelling of 20101220120105 in words is "twenty trillion, one hundred one billion, two hundred twenty million, one hundred twenty thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •