Base | Representation |
---|---|
bin | 110011010100110100… |
… | …1001010010101001010 |
3 | 101112111102222111111200 |
4 | 1212221221022111022 |
5 | 3301212400301442 |
6 | 122345020005030 |
7 | 10651235165001 |
oct | 1465151122512 |
9 | 345442874450 |
10 | 110220322122 |
11 | 42820553409 |
12 | 19440690776 |
13 | a51704b121 |
14 | 5498575c38 |
15 | 2d0161834c |
hex | 19a9a4a54a |
110220322122 has 24 divisors (see below), whose sum is σ = 246514270080. Its totient is φ = 35554942440.
The previous prime is 110220322117. The next prime is 110220322141. The reversal of 110220322122 is 221223022011.
110220322122 is a `hidden beast` number, since 1 + 1 + 0 + 220 + 322 + 122 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 110220322095 and 110220322104.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 98763172 + ... + 98764287.
It is an arithmetic number, because the mean of its divisors is an integer number (10271427920).
Almost surely, 2110220322122 is an apocalyptic number.
110220322122 is an abundant number, since it is smaller than the sum of its proper divisors (136293947958).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110220322122 is a wasteful number, since it uses less digits than its factorization.
110220322122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 197527498 (or 197527495 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 18.
Adding to 110220322122 its reverse (221223022011), we get a palindrome (331443344133).
The spelling of 110220322122 in words is "one hundred ten billion, two hundred twenty million, three hundred twenty-two thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •