Base | Representation |
---|---|
bin | 11001011101110110000110… |
… | …000110011110001000011101 |
3 | 112200120022000202112102020221 |
4 | 121131312012012132020131 |
5 | 104140020311134133041 |
6 | 1034113020540441341 |
7 | 32406612514066405 |
oct | 3135660606361035 |
9 | 480508022472227 |
10 | 112002112021021 |
11 | 3276191338a6a2 |
12 | 1068a914849251 |
13 | 4a659a52720c1 |
14 | 1d92d070c9805 |
15 | ce3672d2e2d1 |
hex | 65dd8619e21d |
112002112021021 has 12 divisors (see below), whose sum is σ = 114808490118432. Its totient is φ = 109262747132000.
The previous prime is 112002112020941. The next prime is 112002112021091. The reversal of 112002112021021 is 120120211200211.
It is not a de Polignac number, because 112002112021021 - 29 = 112002112020509 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112002112020986 and 112002112021004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112002112021091) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 21913176 + ... + 26536606.
It is an arithmetic number, because the mean of its divisors is an integer number (9567374176536).
Almost surely, 2112002112021021 is an apocalyptic number.
It is an amenable number.
112002112021021 is a deficient number, since it is larger than the sum of its proper divisors (2806378097411).
112002112021021 is an equidigital number, since it uses as much as digits as its factorization.
112002112021021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4637924 (or 4637883 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 112002112021021 its reverse (120120211200211), we get a palindrome (232122323221232).
The spelling of 112002112021021 in words is "one hundred twelve trillion, two billion, one hundred twelve million, twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •