Base | Representation |
---|---|
bin | 1001001001100110101100… |
… | …10111001100101100110101 |
3 | 2122020120101122100010120102 |
4 | 10210303112113030230311 |
5 | 10114131231121020041 |
6 | 110443321244243445 |
7 | 4144465445262260 |
oct | 444632627145465 |
9 | 78216348303512 |
10 | 20121223220021 |
11 | 64583a9a484a0 |
12 | 230b764b40585 |
13 | b2c566a32521 |
14 | 4d7c2dc19cd7 |
15 | 24d5ec41209b |
hex | 124cd65ccb35 |
20121223220021 has 64 divisors (see below), whose sum is σ = 26447453683200. Its totient is φ = 14850099532800.
The previous prime is 20121223220017. The next prime is 20121223220023. The reversal of 20121223220021 is 12002232212102.
It is not a de Polignac number, because 20121223220021 - 22 = 20121223220017 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20121223219975 and 20121223220002.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20121223220023) 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 in 63 ways as a sum of consecutive naturals, for example, 50609435 + ... + 51005463.
It is an arithmetic number, because the mean of its divisors is an integer number (413241463800).
Almost surely, 220121223220021 is an apocalyptic number.
It is an amenable number.
20121223220021 is a deficient number, since it is larger than the sum of its proper divisors (6326230463179).
20121223220021 is a wasteful number, since it uses less digits than its factorization.
20121223220021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 396510.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 20121223220021 its reverse (12002232212102), we get a palindrome (32123455432123).
The spelling of 20121223220021 in words is "twenty trillion, one hundred twenty-one billion, two hundred twenty-three million, two hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •