Base | Representation |
---|---|
bin | 10001110001011101000… |
… | …100010001001101011110 |
3 | 11022202110201211200122220 |
4 | 101301131010101031132 |
5 | 130002242010042342 |
6 | 2333023333450210 |
7 | 154144514444025 |
oct | 21613504211536 |
9 | 4282421750586 |
10 | 1221332112222 |
11 | 430a67156802 |
12 | 1788517a0966 |
13 | 8b22bc61b11 |
14 | 431816cd8bc |
15 | 21b8288b5ec |
hex | 11c5d11135e |
1221332112222 has 16 divisors (see below), whose sum is σ = 2508682176912. Its totient is φ = 396107712000.
The previous prime is 1221332112193. The next prime is 1221332112227. The reversal of 1221332112222 is 2222112331221.
It is a nude number because it is divisible by every one of its digits.
It is a junction number, because it is equal to n+sod(n) for n = 1221332112192 and 1221332112201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1221332112227) 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 7 ways as a sum of consecutive naturals, for example, 2750747779 + ... + 2750748222.
It is an arithmetic number, because the mean of its divisors is an integer number (156792636057).
Almost surely, 21221332112222 is an apocalyptic number.
1221332112222 is an abundant number, since it is smaller than the sum of its proper divisors (1287350064690).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1221332112222 is a wasteful number, since it uses less digits than its factorization.
1221332112222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5501496043.
The product of its digits is 1152, while the sum is 24.
Adding to 1221332112222 its reverse (2222112331221), we get a palindrome (3443444443443).
The spelling of 1221332112222 in words is "one trillion, two hundred twenty-one billion, three hundred thirty-two million, one hundred twelve thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •