Base | Representation |
---|---|
bin | 110100001101001010… |
… | …1100100100101110100 |
3 | 101201101012122111201120 |
4 | 1220122111210211310 |
5 | 3314100404342322 |
6 | 123300400023540 |
7 | 11046133611003 |
oct | 1503225444564 |
9 | 351335574646 |
10 | 112111012212 |
11 | 4360081a901 |
12 | 19889901bb0 |
13 | a758972264 |
14 | 55d76d8c3a |
15 | 2db25d7a5c |
hex | 1a1a564974 |
112111012212 has 48 divisors (see below), whose sum is σ = 268961812224. Its totient is φ = 36324288000.
The previous prime is 112111012193. The next prime is 112111012241. The reversal of 112111012212 is 212210111211.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 112111012191 and 112111012200.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 287089 + ... + 553752.
It is an arithmetic number, because the mean of its divisors is an integer number (5603371088).
Almost surely, 2112111012212 is an apocalyptic number.
112111012212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
112111012212 is an abundant number, since it is smaller than the sum of its proper divisors (156850800012).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112111012212 is a wasteful number, since it uses less digits than its factorization.
112111012212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 841160 (or 841158 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 112111012212 its reverse (212210111211), we get a palindrome (324321123423).
The spelling of 112111012212 in words is "one hundred twelve billion, one hundred eleven million, twelve thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •