Base | Representation |
---|---|
bin | 11001011110000110110110… |
… | …010101010111100111000101 |
3 | 112200122000110110011102020012 |
4 | 121132012312111113213011 |
5 | 104140314131340231041 |
6 | 1034125153553120005 |
7 | 32411120350543610 |
oct | 3136066625274705 |
9 | 480560413142205 |
10 | 112020101102021 |
11 | 32769504794492 |
12 | 106922b5259005 |
13 | 4a675b114b728 |
14 | 1d93b322b3177 |
15 | ce3d7727c3eb |
hex | 65e1b65579c5 |
112020101102021 has 16 divisors (see below), whose sum is σ = 129291170611200. Its totient is φ = 95066445350448.
The previous prime is 112020101101969. The next prime is 112020101102053. The reversal of 112020101102021 is 120201101020211.
It is a cyclic number.
It is not a de Polignac number, because 112020101102021 - 214 = 112020101085637 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 112020101101987 and 112020101102005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112020101102071) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11484791 + ... + 18866388.
It is an arithmetic number, because the mean of its divisors is an integer number (8080698163200).
Almost surely, 2112020101102021 is an apocalyptic number.
It is an amenable number.
112020101102021 is a deficient number, since it is larger than the sum of its proper divisors (17271069509179).
112020101102021 is a wasteful number, since it uses less digits than its factorization.
112020101102021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30356408.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 112020101102021 its reverse (120201101020211), we get a palindrome (232221202122232).
The spelling of 112020101102021 in words is "one hundred twelve trillion, twenty billion, one hundred one million, one hundred two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •