Base | Representation |
---|---|
bin | 11001000010010100000010… |
… | …101101011001010101001100 |
3 | 112102212102110201120010111122 |
4 | 121002110002231121111030 |
5 | 103413021012214202340 |
6 | 1030103520340540112 |
7 | 32123123320333115 |
oct | 3102240255312514 |
9 | 472772421503448 |
10 | 110110122022220 |
11 | 320a2493353411 |
12 | 104240b50b1638 |
13 | 4959455b52858 |
14 | 1d2950340920c |
15 | cae33c3aedb5 |
hex | 642502b5954c |
110110122022220 has 12 divisors (see below), whose sum is σ = 231231256246704. Its totient is φ = 44044048808880.
The previous prime is 110110122022217. The next prime is 110110122022231. The reversal of 110110122022220 is 22220221011011.
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 3 ways as a sum of consecutive naturals, for example, 2752753050536 + ... + 2752753050575.
It is an arithmetic number, because the mean of its divisors is an integer number (19269271353892).
Almost surely, 2110110122022220 is an apocalyptic number.
110110122022220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110110122022220 is an abundant number, since it is smaller than the sum of its proper divisors (121121134224484).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110110122022220 is a wasteful number, since it uses less digits than its factorization.
110110122022220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5505506101120 (or 5505506101118 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 110110122022220 its reverse (22220221011011), we get a palindrome (132330343033231).
The spelling of 110110122022220 in words is "one hundred ten trillion, one hundred ten billion, one hundred twenty-two million, twenty-two thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •