Base | Representation |
---|---|
bin | 10010101110000011… |
… | …110101011110001101 |
3 | 1220212210220101122201 |
4 | 102232003311132031 |
5 | 312131112011341 |
6 | 13122303041501 |
7 | 1311046055302 |
oct | 225603653615 |
9 | 56783811581 |
10 | 20100110221 |
11 | 8584a96344 |
12 | 3a8b5a0291 |
13 | 1b84359659 |
14 | d897050a9 |
15 | 7c9943331 |
hex | 4ae0f578d |
20100110221 has 16 divisors (see below), whose sum is σ = 21051072000. Its totient is φ = 19167781248.
The previous prime is 20100110209. The next prime is 20100110311. The reversal of 20100110221 is 12201100102.
It is a cyclic number.
It is not a de Polignac number, because 20100110221 - 217 = 20099979149 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20100110198 and 20100110207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20100110521) 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 in 15 ways as a sum of consecutive naturals, for example, 777916 + ... + 803338.
It is an arithmetic number, because the mean of its divisors is an integer number (1315692000).
Almost surely, 220100110221 is an apocalyptic number.
It is an amenable number.
20100110221 is a deficient number, since it is larger than the sum of its proper divisors (950961779).
20100110221 is a wasteful number, since it uses less digits than its factorization.
20100110221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25788.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 20100110221 its reverse (12201100102), we get a palindrome (32301210323).
It can be divided in two parts, 20100 and 110221, that added together give a 4-th power (130321 = 194).
The spelling of 20100110221 in words is "twenty billion, one hundred million, one hundred ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •