Base | Representation |
---|---|
bin | 10001101000000001101… |
… | …111100001011000111101 |
3 | 11021210100022022201211021 |
4 | 101220001233201120331 |
5 | 124321024230342341 |
6 | 2324231110024141 |
7 | 153335625143266 |
oct | 21500157413075 |
9 | 4253308281737 |
10 | 1211210012221 |
11 | 427742526200 |
12 | 1768a7948051 |
13 | 8a2a7b93931 |
14 | 428a126596d |
15 | 2178de109d1 |
hex | 11a01be163d |
1211210012221 has 24 divisors (see below), whose sum is σ = 1345659066752. Its totient is φ = 1089271260000.
The previous prime is 1211210012219. The next prime is 1211210012261. The reversal of 1211210012221 is 1222100121121.
It is not a de Polignac number, because 1211210012221 - 21 = 1211210012219 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1211210012195 and 1211210012204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1211210012261) 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 23 ways as a sum of consecutive naturals, for example, 12001471 + ... + 12101971.
Almost surely, 21211210012221 is an apocalyptic number.
1211210012221 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1211210012221 is a deficient number, since it is larger than the sum of its proper divisors (134449054531).
1211210012221 is a wasteful number, since it uses less digits than its factorization.
1211210012221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101593 (or 101582 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 1211210012221 its reverse (1222100121121), we get a palindrome (2433310133342).
The spelling of 1211210012221 in words is "one trillion, two hundred eleven billion, two hundred ten million, twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •