Base | Representation |
---|---|
bin | 1001001000111111100101… |
… | …00101111110101001111101 |
3 | 2122011120012000212122101121 |
4 | 10210133302211332221331 |
5 | 10113310223314121341 |
6 | 110425525311510541 |
7 | 4143123145106440 |
oct | 444376245765175 |
9 | 78146160778347 |
10 | 20100222020221 |
11 | 644a502356222 |
12 | 2307683828451 |
13 | b2a59aaba595 |
14 | 4d6bda993657 |
15 | 24ccbd8294d1 |
hex | 1247f297ea7d |
20100222020221 has 8 divisors (see below), whose sum is σ = 22974725379200. Its totient is φ = 17226479428848.
The previous prime is 20100222020189. The next prime is 20100222020237. The reversal of 20100222020221 is 12202022200102.
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 20100222020221 - 25 = 20100222020189 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20100222020195 and 20100222020204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20100222026221) 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, 190135281 + ... + 190240966.
It is an arithmetic number, because the mean of its divisors is an integer number (2871840672400).
Almost surely, 220100222020221 is an apocalyptic number.
It is an amenable number.
20100222020221 is a deficient number, since it is larger than the sum of its proper divisors (2874503358979).
20100222020221 is an equidigital number, since it uses as much as digits as its factorization.
20100222020221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 380383803.
The product of its (nonzero) digits is 128, while the sum is 16.
Adding to 20100222020221 its reverse (12202022200102), we get a palindrome (32302244220323).
The spelling of 20100222020221 in words is "twenty trillion, one hundred billion, two hundred twenty-two million, twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •