Base | Representation |
---|---|
bin | 10110101111111100… |
… | …00101011011110100 |
3 | 1011112011111111100000 |
4 | 23113332011123310 |
5 | 200003101424340 |
6 | 5335525351300 |
7 | 611441301225 |
oct | 132776053364 |
9 | 34464444300 |
10 | 12213311220 |
11 | 51a8106540 |
12 | 244a268530 |
13 | 11c83cc896 |
14 | 83c0a724c |
15 | 4b7358d30 |
hex | 2d7f856f4 |
12213311220 has 144 divisors (see below), whose sum is σ = 41911990848. Its totient is φ = 2960789760.
The previous prime is 12213311197. The next prime is 12213311233. The reversal of 12213311220 is 2211331221.
12213311220 is a `hidden beast` number, since 122 + 13 + 311 + 220 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 12213311193 and 12213311202.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 60769 + ... + 167688.
It is an arithmetic number, because the mean of its divisors is an integer number (291055492).
Almost surely, 212213311220 is an apocalyptic number.
12213311220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12213311220 is an abundant number, since it is smaller than the sum of its proper divisors (29698679628).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12213311220 is a wasteful number, since it uses less digits than its factorization.
12213311220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 228492 (or 228478 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
Adding to 12213311220 its reverse (2211331221), we get a palindrome (14424642441).
The spelling of 12213311220 in words is "twelve billion, two hundred thirteen million, three hundred eleven thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •