Base | Representation |
---|---|
bin | 10000000000101010010… |
… | …110010100010100000100 |
3 | 10220011212101000200202121 |
4 | 100000222112110110010 |
5 | 121011223330334340 |
6 | 2201233550215324 |
7 | 142326346504165 |
oct | 20005226242404 |
9 | 3804771020677 |
10 | 1100222121220 |
11 | 394668782a52 |
12 | 1592921b4544 |
13 | 7c99ab09351 |
14 | 3b372ba776c |
15 | 1d94522994a |
hex | 1002a594504 |
1100222121220 has 24 divisors (see below), whose sum is σ = 2310523737984. Its totient is φ = 440077937376.
The previous prime is 1100222121197. The next prime is 1100222121221. The reversal of 1100222121220 is 221212220011.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 1100222121194 and 1100222121203.
It is not an unprimeable number, because it can be changed into a prime (1100222121221) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 170917 + ... + 1493203.
It is an arithmetic number, because the mean of its divisors is an integer number (96271822416).
Almost surely, 21100222121220 is an apocalyptic number.
1100222121220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1100222121220 is an abundant number, since it is smaller than the sum of its proper divisors (1210301616764).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1100222121220 is a wasteful number, since it uses less digits than its factorization.
1100222121220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1363899 (or 1363897 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 1100222121220 its reverse (221212220011), we get a palindrome (1321434341231).
The spelling of 1100222121220 in words is "one trillion, one hundred billion, two hundred twenty-two million, one hundred twenty-one thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •