Base | Representation |
---|---|
bin | 11001011110001000101101… |
… | …011111010100111000110100 |
3 | 112200122012121202211011111120 |
4 | 121132020231133110320310 |
5 | 104140332230122413022 |
6 | 1034130124204503540 |
7 | 32411221033603551 |
oct | 3136105537247064 |
9 | 480565552734446 |
10 | 112022100201012 |
11 | 3276a340176111 |
12 | 1069277284abb0 |
13 | 4a6783c36b941 |
14 | 1d93c819b5a28 |
15 | ce3e42a12d5c |
hex | 65e22d7d4e34 |
112022100201012 has 24 divisors (see below), whose sum is σ = 261388275738912. Its totient is φ = 37340217885600.
The previous prime is 112022100200951. The next prime is 112022100201041. The reversal of 112022100201012 is 210102001220211.
It is a junction number, because it is equal to n+sod(n) for n = 112022100200982 and 112022100201000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 59304039 + ... + 61163822.
It is an arithmetic number, because the mean of its divisors is an integer number (10891178155788).
Almost surely, 2112022100201012 is an apocalyptic number.
112022100201012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
112022100201012 is an abundant number, since it is smaller than the sum of its proper divisors (149366175537900).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112022100201012 is a wasteful number, since it uses less digits than its factorization.
112022100201012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120545359 (or 120545357 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 112022100201012 its reverse (210102001220211), we get a palindrome (322124101421223).
The spelling of 112022100201012 in words is "one hundred twelve trillion, twenty-two billion, one hundred million, two hundred one thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •