Base | Representation |
---|---|
bin | 11001011101110110000000… |
… | …001001101110011100111000 |
3 | 112200120021202210201112122111 |
4 | 121131312000021232130320 |
5 | 104140020110111223000 |
6 | 1034113003013302104 |
7 | 32406610162525162 |
oct | 3135660011563470 |
9 | 480507683645574 |
10 | 112002012211000 |
11 | 3276187200897a |
12 | 1068a8a7334934 |
13 | 4a6598a696c12 |
14 | 1d92cd7b47932 |
15 | ce36691b5cba |
hex | 65dd8026e738 |
112002012211000 has 64 divisors (see below), whose sum is σ = 262088143200000. Its totient is φ = 44800217769600.
The previous prime is 112002012210983. The next prime is 112002012211079. The reversal of 112002012211000 is 112210200211.
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 15 ways as a sum of consecutive naturals, for example, 80055481 + ... + 81442519.
It is an arithmetic number, because the mean of its divisors is an integer number (4095127237500).
Almost surely, 2112002012211000 is an apocalyptic number.
112002012211000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
112002012211000 is an abundant number, since it is smaller than the sum of its proper divisors (150086130989000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112002012211000 is a wasteful number, since it uses less digits than its factorization.
112002012211000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1467809 (or 1467795 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 112002012211000 its reverse (112210200211), we get a palindrome (112114222411211).
The spelling of 112002012211000 in words is "one hundred twelve trillion, two billion, twelve million, two hundred eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •