Base | Representation |
---|---|
bin | 11001011111011011101110… |
… | …001110101111001101111110 |
3 | 112200221201200121021201020011 |
4 | 121133123232032233031332 |
5 | 104143312301144413042 |
6 | 1034235104534213434 |
7 | 32420524604603416 |
oct | 3137335616571576 |
9 | 480851617251204 |
10 | 112111233201022 |
11 | 327a411a454290 |
12 | 106a7aa91b427a |
13 | 4a7307567cb73 |
14 | 1d982d96a7646 |
15 | ce640cbd0a17 |
hex | 65f6ee3af37e |
112111233201022 has 32 divisors (see below), whose sum is σ = 184293917743104. Its totient is φ = 50726623526400.
The previous prime is 112111233201007. The next prime is 112111233201041. The reversal of 112111233201022 is 220102332111211.
It is a happy number.
112111233201022 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a junction number, because it is equal to n+sod(n) for n = 112111233200984 and 112111233201002.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 27843747 + ... + 31614817.
It is an arithmetic number, because the mean of its divisors is an integer number (5759184929472).
Almost surely, 2112111233201022 is an apocalyptic number.
112111233201022 is a deficient number, since it is larger than the sum of its proper divisors (72182684542082).
112111233201022 is a wasteful number, since it uses less digits than its factorization.
112111233201022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3777264.
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 112111233201022 its reverse (220102332111211), we get a palindrome (332213565312233).
The spelling of 112111233201022 in words is "one hundred twelve trillion, one hundred eleven billion, two hundred thirty-three million, two hundred one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •