Base | Representation |
---|---|
bin | 11001011111010011001001… |
… | …001000111111001100100101 |
3 | 112200220211220120220111220120 |
4 | 121133103021020333030211 |
5 | 104143134414334031041 |
6 | 1034230542452552153 |
7 | 32420050404316401 |
oct | 3137231110771445 |
9 | 480824816814816 |
10 | 112102021002021 |
11 | 327a02223a8886 |
12 | 106a6158022659 |
13 | 4a72237c63b3b |
14 | 1d97aa4016101 |
15 | ce606e08a366 |
hex | 65f4c923f325 |
112102021002021 has 8 divisors (see below), whose sum is σ = 149470515763680. Its totient is φ = 74734103454192.
The previous prime is 112102021002017. The next prime is 112102021002031. The reversal of 112102021002021 is 120200120201211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 112102021002021 - 22 = 112102021002017 is a prime.
It is a super-2 number, since 2×1121020210020212 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112102021002031) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 143850091 + ... + 144627288.
It is an arithmetic number, because the mean of its divisors is an integer number (18683814470460).
Almost surely, 2112102021002021 is an apocalyptic number.
It is an amenable number.
112102021002021 is a deficient number, since it is larger than the sum of its proper divisors (37368494761659).
112102021002021 is a wasteful number, since it uses less digits than its factorization.
112102021002021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 288606915.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 112102021002021 its reverse (120200120201211), we get a palindrome (232302141203232).
The spelling of 112102021002021 in words is "one hundred twelve trillion, one hundred two billion, twenty-one million, two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •