Base | Representation |
---|---|
bin | 1010000011011111010011… |
… | …11110010110110000110000 |
3 | 2220021201002102111011102111 |
4 | 11001233221332112300300 |
5 | 10344223012230010000 |
6 | 115005125550055104 |
7 | 4441255303020151 |
oct | 501575176266060 |
9 | 86251072434374 |
10 | 22110122110000 |
11 | 7054939580a91 |
12 | 259110b1aa494 |
13 | c44c8b42a432 |
14 | 5661c81d9928 |
15 | 285205a2bcba |
hex | 141be9f96c30 |
22110122110000 has 100 divisors (see below), whose sum is σ = 54669771348192. Its totient is φ = 8655877408000.
The previous prime is 22110122109991. The next prime is 22110122110031. The reversal of 22110122110000 is 1122101122.
It is a tau number, because it is divible by the number of its divisors (100).
It is a super-2 number, since 2×221101221100002 (a number of 27 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 19 ways as a sum of consecutive naturals, for example, 23051407 + ... + 23991406.
Almost surely, 222110122110000 is an apocalyptic number.
22110122110000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
22110122110000 is an abundant number, since it is smaller than the sum of its proper divisors (32559649238192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
22110122110000 is an equidigital number, since it uses as much as digits as its factorization.
22110122110000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47042888 (or 47042867 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 22110122110000 its reverse (1122101122), we get a palindrome (22111244211122).
The spelling of 22110122110000 in words is "twenty-two trillion, one hundred ten billion, one hundred twenty-two million, one hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •