Base | Representation |
---|---|
bin | 11001011101111110100011… |
… | …110010110001111010000010 |
3 | 112200121011111010101011220211 |
4 | 121131332203302301322002 |
5 | 104140142414212011320 |
6 | 1034121122430024334 |
7 | 32410353646424302 |
oct | 3135764362617202 |
9 | 480534433334824 |
10 | 112011200110210 |
11 | 32765757377605 |
12 | 106906303480aa |
13 | 4a667c305567b |
14 | 1d9352a0b1602 |
15 | ce3a05b0b55a |
hex | 65dfa3cb1e82 |
112011200110210 has 64 divisors (see below), whose sum is σ = 229941921052800. Its totient is φ = 39020447112192.
The previous prime is 112011200110171. The next prime is 112011200110211. The reversal of 112011200110210 is 12011002110211.
It is a happy number.
It is a super-2 number, since 2×1120112001102102 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (112011200110211) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 403098205 + ... + 403375984.
It is an arithmetic number, because the mean of its divisors is an integer number (3592842516450).
Almost surely, 2112011200110210 is an apocalyptic number.
112011200110210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
112011200110210 is an abundant number, since it is smaller than the sum of its proper divisors (117930720942590).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112011200110210 is a wasteful number, since it uses less digits than its factorization.
112011200110210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 806474275.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 112011200110210 its reverse (12011002110211), we get a palindrome (124022202220421).
The spelling of 112011200110210 in words is "one hundred twelve trillion, eleven billion, two hundred million, one hundred ten thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •