Base | Representation |
---|---|
bin | 11001010001000001101100… |
… | …111010101111101010001000 |
3 | 112120110002021222002021100222 |
4 | 121101001230322233222020 |
5 | 104031102230113033000 |
6 | 1032200215001445212 |
7 | 32256146310612224 |
oct | 3121015472575210 |
9 | 476402258067328 |
10 | 111121221221000 |
11 | 32452277500661 |
12 | 105680541a0808 |
13 | 4a008bc768923 |
14 | 1d6241d985784 |
15 | cca7b825ca85 |
hex | 65106ceafa88 |
111121221221000 has 128 divisors (see below), whose sum is σ = 275245574947200. Its totient is φ = 41917740076800.
The previous prime is 111121221220981. The next prime is 111121221221011. The reversal of 111121221221000 is 122122121111.
It is a self number, because there is not a number n which added to its sum of digits gives 111121221221000.
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, 43308422 + ... + 45802421.
It is an arithmetic number, because the mean of its divisors is an integer number (2150356054275).
Almost surely, 2111121221221000 is an apocalyptic number.
111121221221000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
111121221221000 is an abundant number, since it is smaller than the sum of its proper divisors (164124353726200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111121221221000 is a wasteful number, since it uses less digits than its factorization.
111121221221000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 89110936 (or 89110922 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 111121221221000 its reverse (122122121111), we get a palindrome (111243343342111).
The spelling of 111121221221000 in words is "one hundred eleven trillion, one hundred twenty-one billion, two hundred twenty-one million, two hundred twenty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •