Base | Representation |
---|---|
bin | 110010010011000010111001… |
… | …000110111101000011101100 |
3 | 1002000020120111222201010200122 |
4 | 302103002321012331003230 |
5 | 212443310313403033400 |
6 | 2102250551005544112 |
7 | 64410655210014524 |
oct | 6223027106750354 |
9 | 1060216458633618 |
10 | 221211101221100 |
11 | 64537112750171 |
12 | 2098823a275038 |
13 | 965816aa354a3 |
14 | 3c8a9628a8684 |
15 | 1a8931d4e6685 |
hex | c930b91bd0ec |
221211101221100 has 36 divisors (see below), whose sum is σ = 480030593784000. Its totient is φ = 88483978896960.
The previous prime is 221211101221091. The next prime is 221211101221207. The reversal of 221211101221100 is 1122101112122.
It is a super-2 number, since 2×2212111012211002 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 13826501 + ... + 25171299.
Almost surely, 2221211101221100 is an apocalyptic number.
221211101221100 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
221211101221100 is an abundant number, since it is smaller than the sum of its proper divisors (258819492562900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
221211101221100 is a wasteful number, since it uses less digits than its factorization.
221211101221100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11539802 (or 11539795 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 221211101221100 its reverse (1122101112122), we get a palindrome (222333202333222).
The spelling of 221211101221100 in words is "two hundred twenty-one trillion, two hundred eleven billion, one hundred one million, two hundred twenty-one thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •