Base | Representation |
---|---|
bin | 1011000110110001100110… |
… | …0001000100010010000110 |
3 | 1121020100202222122221122201 |
4 | 2301230121201010102012 |
5 | 3100031132122334342 |
6 | 41545355403345114 |
7 | 2400134314314556 |
oct | 261543141042206 |
9 | 47210688587581 |
10 | 12211020121222 |
11 | 39887345771aa |
12 | 14526b1b2219a |
13 | 6a7656b5ca40 |
14 | 3030334cb166 |
15 | 162983aaadb7 |
hex | b1b19844486 |
12211020121222 has 192 divisors, whose sum is σ = 21939771248640. Its totient is φ = 5056489152000.
The previous prime is 12211020121217. The next prime is 12211020121229. The reversal of 12211020121222 is 22212102011221.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a self number, because there is not a number n which added to its sum of digits gives 12211020121222.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12211020121229) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 16983337779 + ... + 16983338497.
It is an arithmetic number, because the mean of its divisors is an integer number (114269641920).
Almost surely, 212211020121222 is an apocalyptic number.
12211020121222 is a deficient number, since it is larger than the sum of its proper divisors (9728751127418).
12211020121222 is a wasteful number, since it uses less digits than its factorization.
12211020121222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1467 (or 1448 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 12211020121222 its reverse (22212102011221), we get a palindrome (34423122132443).
The spelling of 12211020121222 in words is "twelve trillion, two hundred eleven billion, twenty million, one hundred twenty-one thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •