Base | Representation |
---|---|
bin | 11101001111111110101… |
… | …001110100010011001101 |
3 | 21010011012220012101122020 |
4 | 131033332221310103031 |
5 | 230413011124232341 |
6 | 4135220313240353 |
7 | 265135135653000 |
oct | 35177651642315 |
9 | 7104186171566 |
10 | 2010022102221 |
11 | 70549a0915a1 |
12 | 2856804030b9 |
13 | 11770c9bca83 |
14 | 6d3dd927537 |
15 | 37442ca4566 |
hex | 1d3fea744cd |
2010022102221 has 96 divisors (see below), whose sum is σ = 3315248640000. Its totient is φ = 1082624447520.
The previous prime is 2010022102211. The next prime is 2010022102273. The reversal of 2010022102221 is 1222012200102.
It is not a de Polignac number, because 2010022102221 - 215 = 2010022069453 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2010022102221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2010022102201) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 73908736 + ... + 73935926.
It is an arithmetic number, because the mean of its divisors is an integer number (34533840000).
Almost surely, 22010022102221 is an apocalyptic number.
2010022102221 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2010022102221 is a deficient number, since it is larger than the sum of its proper divisors (1305226537779).
2010022102221 is a wasteful number, since it uses less digits than its factorization.
2010022102221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27452 (or 27419 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 2010022102221 its reverse (1222012200102), we get a palindrome (3232034302323).
The spelling of 2010022102221 in words is "two trillion, ten billion, twenty-two million, one hundred two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •