Base | Representation |
---|---|
bin | 11110100100101110100… |
… | …111110101001101000101 |
3 | 21102212002210001120221020 |
4 | 132210232213311031011 |
5 | 233410342411414341 |
6 | 4245110143541353 |
7 | 304536156355425 |
oct | 36445647651505 |
9 | 7385083046836 |
10 | 2101021201221 |
11 | 740046770538 |
12 | 29b2378ba859 |
13 | 1231827c5097 |
14 | 739933ba485 |
15 | 399bbbd5566 |
hex | 1e92e9f5345 |
2101021201221 has 16 divisors (see below), whose sum is σ = 2886287359680. Its totient is φ = 1358811808640.
The previous prime is 2101021201207. The next prime is 2101021201243. The reversal of 2101021201221 is 1221021201012.
It is a cyclic number.
It is not a de Polignac number, because 2101021201221 - 25 = 2101021201189 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2101021201221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2101021201261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 74221635 + ... + 74249936.
It is an arithmetic number, because the mean of its divisors is an integer number (180392959980).
Almost surely, 22101021201221 is an apocalyptic number.
It is an amenable number.
2101021201221 is a deficient number, since it is larger than the sum of its proper divisors (785266158459).
2101021201221 is a wasteful number, since it uses less digits than its factorization.
2101021201221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 148471716.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 2101021201221 its reverse (1221021201012), we get a palindrome (3322042402233).
The spelling of 2101021201221 in words is "two trillion, one hundred one billion, twenty-one million, two hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •