Base | Representation |
---|---|
bin | 1100111011011011101… |
… | …0011110000111101100 |
3 | 210020022101010102021110 |
4 | 3032312322132013230 |
5 | 12114341200110012 |
6 | 250011545232020 |
7 | 22022100545100 |
oct | 3166672360754 |
9 | 706271112243 |
10 | 222112113132 |
11 | 86219552068 |
12 | 37068a92610 |
13 | 17c394662a0 |
14 | aa70ac7900 |
15 | 5b9e84b73c |
hex | 33b6e9e1ec |
222112113132 has 72 divisors (see below), whose sum is σ = 649250814576. Its totient is φ = 58579016832.
The previous prime is 222112113079. The next prime is 222112113137. The reversal of 222112113132 is 231311211222.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a nude number because it is divisible by every one of its digits.
It is a junction number, because it is equal to n+sod(n) for n = 222112113099 and 222112113108.
It is not an unprimeable number, because it can be changed into a prime (222112113137) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 14520883 + ... + 14536170.
Almost surely, 2222112113132 is an apocalyptic number.
It is an amenable number.
222112113132 is an abundant number, since it is smaller than the sum of its proper divisors (427138701444).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
222112113132 is a wasteful number, since it uses less digits than its factorization.
222112113132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29057087 (or 29057078 counting only the distinct ones).
The product of its digits is 288, while the sum is 21.
Adding to 222112113132 its reverse (231311211222), we get a palindrome (453423324354).
The spelling of 222112113132 in words is "two hundred twenty-two billion, one hundred twelve million, one hundred thirteen thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •