Base | Representation |
---|---|
bin | 110000000000001100110100… |
… | …101011011000001001100100 |
3 | 1000200111212121212202101120122 |
4 | 300000030310223120021210 |
5 | 210132442230303034340 |
6 | 2025003104543421112 |
7 | 62316626304201020 |
oct | 6000146453301144 |
9 | 1020455555671518 |
10 | 211120001221220 |
11 | 612a6542890953 |
12 | 1b8185792b4798 |
13 | 90a56b8c070c0 |
14 | 3a1c39673d380 |
15 | 1961ab0890db5 |
hex | c00334ad8264 |
211120001221220 has 48 divisors (see below), whose sum is σ = 545664003161088. Its totient is φ = 66816000385920.
The previous prime is 211120001221183. The next prime is 211120001221303. The reversal of 211120001221220 is 22122100021112.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 57999998516 + ... + 58000002155.
It is an arithmetic number, because the mean of its divisors is an integer number (11368000065856).
Almost surely, 2211120001221220 is an apocalyptic number.
211120001221220 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
211120001221220 is an abundant number, since it is smaller than the sum of its proper divisors (334544001939868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211120001221220 is a wasteful number, since it uses less digits than its factorization.
211120001221220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116000000700 (or 116000000698 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 211120001221220 its reverse (22122100021112), we get a palindrome (233242101242332).
The spelling of 211120001221220 in words is "two hundred eleven trillion, one hundred twenty billion, one million, two hundred twenty-one thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •