Base | Representation |
---|---|
bin | 10000000001011111111… |
… | …011101100100010010010 |
3 | 10220021012000122011120012 |
4 | 100001133323230202102 |
5 | 121020044001042320 |
6 | 2201503102514522 |
7 | 142360544011160 |
oct | 20013773544222 |
9 | 3807160564505 |
10 | 1101121112210 |
11 | 394a8a186209 |
12 | 1594a3295a42 |
13 | 7cab213b692 |
14 | 3b41a340230 |
15 | 1d9991074c5 |
hex | 1005feec892 |
1101121112210 has 64 divisors (see below), whose sum is σ = 2399313208320. Its totient is φ = 355185699840.
The previous prime is 1101121112207. The next prime is 1101121112243. The reversal of 1101121112210 is 122111211011.
It is a super-2 number, since 2×11011211122102 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 3005276 + ... + 3351704.
It is an arithmetic number, because the mean of its divisors is an integer number (37489268880).
Almost surely, 21101121112210 is an apocalyptic number.
1101121112210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1101121112210 is an abundant number, since it is smaller than the sum of its proper divisors (1298192096110).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101121112210 is a wasteful number, since it uses less digits than its factorization.
1101121112210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 349131.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 1101121112210 its reverse (122111211011), we get a palindrome (1223232323221).
The spelling of 1101121112210 in words is "one trillion, one hundred one billion, one hundred twenty-one million, one hundred twelve thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •