Base | Representation |
---|---|
bin | 1001000110011001110001… |
… | …00001101111011100000101 |
3 | 2121212001102000010022201211 |
4 | 10203030320201233130011 |
5 | 10110330414424014341 |
6 | 110321004022251421 |
7 | 4133522133662053 |
oct | 443147041573405 |
9 | 77761360108654 |
10 | 20011201001221 |
11 | 6415780302041 |
12 | 22b237a886b71 |
13 | b22081a56301 |
14 | 4d2793ad11d3 |
15 | 24a80d3cb181 |
hex | 12333886f705 |
20011201001221 has 8 divisors (see below), whose sum is σ = 20043753125760. Its totient is φ = 19978662686928.
The previous prime is 20011201001219. The next prime is 20011201001257. The reversal of 20011201001221 is 12210010211002.
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 20011201001221 - 21 = 20011201001219 is a prime.
It is a super-2 number, since 2×200112010012212 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20011201005221) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 550201 + ... + 6350206.
It is an arithmetic number, because the mean of its divisors is an integer number (2505469140720).
Almost surely, 220011201001221 is an apocalyptic number.
It is an amenable number.
20011201001221 is a deficient number, since it is larger than the sum of its proper divisors (32552124539).
20011201001221 is an equidigital number, since it uses as much as digits as its factorization.
20011201001221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6905123.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 20011201001221 its reverse (12210010211002), we get a palindrome (32221211212223).
The spelling of 20011201001221 in words is "twenty trillion, eleven billion, two hundred one million, one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •