Base | Representation |
---|---|
bin | 10000001011111100000… |
… | …111001101010001111000 |
3 | 10221100010021121020020100 |
4 | 100023330013031101320 |
5 | 121211023303411300 |
6 | 2210555320155400 |
7 | 143235415064145 |
oct | 20137407152170 |
9 | 3840107536210 |
10 | 1112331310200 |
11 | 399812031950 |
12 | 15b6b1608b60 |
13 | 80b7a781026 |
14 | 3bba10c93cc |
15 | 1de03367700 |
hex | 102fc1cd478 |
1112331310200 has 144 divisors (see below), whose sum is σ = 4075177509000. Its totient is φ = 269656070400.
The previous prime is 1112331310157. The next prime is 1112331310219. The reversal of 1112331310200 is 20131332111.
1112331310200 is a `hidden beast` number, since 1 + 1 + 1 + 2 + 331 + 310 + 20 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 28069375 + ... + 28108974.
Almost surely, 21112331310200 is an apocalyptic number.
1112331310200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1112331310200 is an abundant number, since it is smaller than the sum of its proper divisors (2962846198800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1112331310200 is a wasteful number, since it uses less digits than its factorization.
1112331310200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56178382 (or 56178370 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 1112331310200 its reverse (20131332111), we get a palindrome (1132462642311).
The spelling of 1112331310200 in words is "one trillion, one hundred twelve billion, three hundred thirty-one million, three hundred ten thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •