Base | Representation |
---|---|
bin | 1001001011111101001010… |
… | …0001111010111000111101 |
3 | 1022202122110001222001021110 |
4 | 2102333102201322320331 |
5 | 2310443322024021341 |
6 | 33252200242152233 |
7 | 2061526126141611 |
oct | 222772241727075 |
9 | 38678401861243 |
10 | 10101000220221 |
11 | 32448a03233a9 |
12 | 1171784652679 |
13 | 58369bc51441 |
14 | 26cc68d57341 |
15 | 127b3bda4216 |
hex | 92fd287ae3d |
10101000220221 has 16 divisors (see below), whose sum is σ = 13573249899264. Its totient is φ = 6681561628224.
The previous prime is 10101000220159. The next prime is 10101000220243. The reversal of 10101000220221 is 12202200010101.
It is a de Polignac number, because none of the positive numbers 2k-10101000220221 is a prime.
It is a super-3 number, since 3×101010002202213 (a number of 40 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10101000220197 and 10101000220206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10101000222221) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 23068350 + ... + 23502143.
It is an arithmetic number, because the mean of its divisors is an integer number (848328118704).
Almost surely, 210101000220221 is an apocalyptic number.
It is an amenable number.
10101000220221 is a deficient number, since it is larger than the sum of its proper divisors (3472249679043).
10101000220221 is a wasteful number, since it uses less digits than its factorization.
10101000220221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46571060.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 10101000220221 its reverse (12202200010101), we get a palindrome (22303200230322).
The spelling of 10101000220221 in words is "ten trillion, one hundred one billion, two hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •