Base | Representation |
---|---|
bin | 110011001110111010… |
… | …1000101101010010100 |
3 | 101111222122000220020022 |
4 | 1212131311011222110 |
5 | 3300311130402012 |
6 | 122313215524312 |
7 | 10643310415316 |
oct | 1463565055224 |
9 | 344878026208 |
10 | 110022122132 |
11 | 4272968a86a |
12 | 193a6229698 |
13 | a4b4c74220 |
14 | 547a1017b6 |
15 | 2cde017472 |
hex | 199dd45a94 |
110022122132 has 12 divisors (see below), whose sum is σ = 207349384116. Its totient is φ = 50779440960.
The previous prime is 110022122131. The next prime is 110022122143. The reversal of 110022122132 is 231221220011.
It can be written as a sum of positive squares in 2 ways, for example, as 56270481796 + 53751640336 = 237214^2 + 231844^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 110022122132.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110022122131) by changing a digit.
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, 1057904969 + ... + 1057905072.
It is an arithmetic number, because the mean of its divisors is an integer number (17279115343).
Almost surely, 2110022122132 is an apocalyptic number.
It is an amenable number.
110022122132 is a deficient number, since it is larger than the sum of its proper divisors (97327261984).
110022122132 is a wasteful number, since it uses less digits than its factorization.
110022122132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2115810058 (or 2115810056 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 17.
Adding to 110022122132 its reverse (231221220011), we get a palindrome (341243342143).
The spelling of 110022122132 in words is "one hundred ten billion, twenty-two million, one hundred twenty-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •