Base | Representation |
---|---|
bin | 110000000001101011111010… |
… | …111001010100000010111000 |
3 | 1000200212122012002100011022120 |
4 | 300001223322321110002320 |
5 | 210141130340404323000 |
6 | 2025122033114521240 |
7 | 62330202550116105 |
oct | 6001537271240270 |
9 | 1020778162304276 |
10 | 211222111011000 |
11 | 61335881131271 |
12 | 1b834315736220 |
13 | 90b220c85165b |
14 | 3a232c1a77aac |
15 | 1964589e286a0 |
hex | c01afae540b8 |
211222111011000 has 128 divisors (see below), whose sum is σ = 676824148503360. Its totient is φ = 54803574720000.
The previous prime is 211222111010959. The next prime is 211222111011017. The reversal of 211222111011000 is 110111222112.
It is a happy number.
It is a super-2 number, since 2×2112221110110002 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 951339951 + ... + 951561950.
Almost surely, 2211222111011000 is an apocalyptic number.
211222111011000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
211222111011000 is an abundant number, since it is smaller than the sum of its proper divisors (465602037492360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
211222111011000 is a wasteful number, since it uses less digits than its factorization.
211222111011000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1902901962 (or 1902901948 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 211222111011000 its reverse (110111222112), we get a palindrome (211332222233112).
The spelling of 211222111011000 in words is "two hundred eleven trillion, two hundred twenty-two billion, one hundred eleven million, eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •