Base | Representation |
---|---|
bin | 10100100001111011… |
… | …01000011011111110 |
3 | 1001110010212010102200 |
4 | 22100331220123332 |
5 | 140033113310420 |
6 | 5021411532330 |
7 | 540064353156 |
oct | 122075503376 |
9 | 31403763380 |
10 | 11022010110 |
11 | 4746701371 |
12 | 21772ba0a6 |
13 | 1068662997 |
14 | 767b9d766 |
15 | 44798ab90 |
hex | 290f686fe |
11022010110 has 24 divisors (see below), whose sum is σ = 28657226520. Its totient is φ = 2939202672.
The previous prime is 11022010081. The next prime is 11022010123. The reversal of 11022010110 is 1101022011.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 11022010092 and 11022010101.
It is a congruent number.
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 11 ways as a sum of consecutive naturals, for example, 61233300 + ... + 61233479.
It is an arithmetic number, because the mean of its divisors is an integer number (1194051105).
Almost surely, 211022010110 is an apocalyptic number.
11022010110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11022010110 is an abundant number, since it is smaller than the sum of its proper divisors (17635216410).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11022010110 is a wasteful number, since it uses less digits than its factorization.
11022010110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 122466792 (or 122466789 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 11022010110 its reverse (1101022011), we get a palindrome (12123032121).
The spelling of 11022010110 in words is "eleven billion, twenty-two million, ten thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •