Base | Representation |
---|---|
bin | 11001011111010011001001… |
… | …001001010111000111100000 |
3 | 112200220211220121002111022102 |
4 | 121133103021021113013200 |
5 | 104143134414400200000 |
6 | 1034230542455025532 |
7 | 32420050405205141 |
oct | 3137231111270740 |
9 | 480824817074272 |
10 | 112102021100000 |
11 | 327a0222465458 |
12 | 106a615806b2a8 |
13 | 4a72237c99609 |
14 | 1d97aa403dac8 |
15 | ce606e0a93d5 |
hex | 65f4c92571e0 |
112102021100000 has 72 divisors (see below), whose sum is σ = 275858411728536. Its totient is φ = 44840808400000.
The previous prime is 112102021099997. The next prime is 112102021100021. The reversal of 112102021100000 is 1120201211.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 560410106 + ... + 560610105.
It is an arithmetic number, because the mean of its divisors is an integer number (3831366829563).
Almost surely, 2112102021100000 is an apocalyptic number.
112102021100000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112102021100000 is an abundant number, since it is smaller than the sum of its proper divisors (163756390628536).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112102021100000 is an frugal number, since it uses more digits than its factorization.
112102021100000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1121020246 (or 1121020218 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 112102021100000 its reverse (1120201211), we get a palindrome (112103141301211).
The spelling of 112102021100000 in words is "one hundred twelve trillion, one hundred two billion, twenty-one million, one hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.145 sec. • engine limits •