Base | Representation |
---|---|
bin | 10000000000101010010… |
… | …110010001110100100010 |
3 | 10220011212101000011202110 |
4 | 100000222112101310202 |
5 | 121011223330023020 |
6 | 2201233550100150 |
7 | 142326346432341 |
oct | 20005226216442 |
9 | 3804771004673 |
10 | 1100222111010 |
11 | 394668776310 |
12 | 1592921aa656 |
13 | 7c99ab047c9 |
14 | 3b372ba3b58 |
15 | 1d9452268e0 |
hex | 1002a591d22 |
1100222111010 has 256 divisors, whose sum is σ = 3016940359680. Its totient is φ = 254404592640.
The previous prime is 1100222110987. The next prime is 1100222111017. The reversal of 1100222111010 is 101112220011.
It is not an unprimeable number, because it can be changed into a prime (1100222111017) by changing a digit.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 285992907 + ... + 285996753.
It is an arithmetic number, because the mean of its divisors is an integer number (11784923280).
Almost surely, 21100222111010 is an apocalyptic number.
1100222111010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 1100222111010, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1508470179840).
1100222111010 is an abundant number, since it is smaller than the sum of its proper divisors (1916718248670).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1100222111010 is a wasteful number, since it uses less digits than its factorization.
1100222111010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4361.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1100222111010 its reverse (101112220011), we get a palindrome (1201334331021).
The spelling of 1100222111010 in words is "one trillion, one hundred billion, two hundred twenty-two million, one hundred eleven thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •