Base | Representation |
---|---|
bin | 11001011101111101101000… |
… | …001100011011101100100110 |
3 | 112200121001220102212120202020 |
4 | 121131331220030123230212 |
5 | 104140133342222431042 |
6 | 1034120435310324010 |
7 | 32410320115355133 |
oct | 3135755014335446 |
9 | 480531812776666 |
10 | 112010200202022 |
11 | 32765293a06801 |
12 | 106903b14b9606 |
13 | 4a66693b4b215 |
14 | 1d9347338958a |
15 | ce3997e473ec |
hex | 65df6831bb26 |
112010200202022 has 32 divisors (see below), whose sum is σ = 227658121039872. Its totient is φ = 36731888454624.
The previous prime is 112010200201993. The next prime is 112010200202027. The reversal of 112010200202022 is 220202002010211.
It is a super-2 number, since 2×1120102002020222 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 112010200201992 and 112010200202010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112010200202027) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 179917158 + ... + 180538649.
It is an arithmetic number, because the mean of its divisors is an integer number (7114316282496).
Almost surely, 2112010200202022 is an apocalyptic number.
112010200202022 is an abundant number, since it is smaller than the sum of its proper divisors (115647920837850).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112010200202022 is a wasteful number, since it uses less digits than its factorization.
112010200202022 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 360456652.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 112010200202022 its reverse (220202002010211), we get a palindrome (332212202212233).
The spelling of 112010200202022 in words is "one hundred twelve trillion, ten billion, two hundred million, two hundred two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •