Base | Representation |
---|---|
bin | 11001011110000111101101… |
… | …000110101110101000000100 |
3 | 112200122002211111020211101112 |
4 | 121132013231012232220010 |
5 | 104140323022110323022 |
6 | 1034125425100344152 |
7 | 32411152206255560 |
oct | 3136075506565004 |
9 | 480562744224345 |
10 | 112021020011012 |
11 | 32769936461402 |
12 | 10692510b45058 |
13 | 4a676c9635a68 |
14 | 1d93bbc3526a0 |
15 | ce3dccc918e2 |
hex | 65e1ed1aea04 |
112021020011012 has 12 divisors (see below), whose sum is σ = 224042040022080. Its totient is φ = 48009008576136.
The previous prime is 112021020010981. The next prime is 112021020011023. The reversal of 112021020011012 is 210110020120211.
112021020011012 is an admirable number.
It is a Harshad number since it is a multiple of its sum of digits (14).
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 3 ways as a sum of consecutive naturals, for example, 2000375357312 + ... + 2000375357367.
It is an arithmetic number, because the mean of its divisors is an integer number (18670170001840).
Almost surely, 2112021020011012 is an apocalyptic number.
It is an amenable number.
112021020011012 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112021020011012 is a wasteful number, since it uses less digits than its factorization.
112021020011012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4000750714690 (or 4000750714688 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 112021020011012 its reverse (210110020120211), we get a palindrome (322131040131223).
The spelling of 112021020011012 in words is "one hundred twelve trillion, twenty-one billion, twenty million, eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •