Base | Representation |
---|---|
bin | 11001011101110100001000… |
… | …110011111001111001100101 |
3 | 112200120002121021012210021101 |
4 | 121131310020303321321211 |
5 | 104140002010030031041 |
6 | 1034112032211120101 |
7 | 32406506441163211 |
oct | 3135641063717145 |
9 | 480502537183241 |
10 | 112000010002021 |
11 | 32760a348a2709 |
12 | 1068a4288a3031 |
13 | 4a6572b92828b |
14 | 1d92b87c75941 |
15 | ce359d518b31 |
hex | 65dd08cf9e65 |
112000010002021 has 2 divisors, whose sum is σ = 112000010002022. Its totient is φ = 112000010002020.
The previous prime is 112000010001967. The next prime is 112000010002033. The reversal of 112000010002021 is 120200010000211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 107417781705025 + 4582228296996 = 10364255^2 + 2140614^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112000010002021 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112000010001989 and 112000010002007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112000010002091) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56000005001010 + 56000005001011.
It is an arithmetic number, because the mean of its divisors is an integer number (56000005001011).
Almost surely, 2112000010002021 is an apocalyptic number.
It is an amenable number.
112000010002021 is a deficient number, since it is larger than the sum of its proper divisors (1).
112000010002021 is an equidigital number, since it uses as much as digits as its factorization.
112000010002021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 10.
Adding to 112000010002021 its reverse (120200010000211), we get a palindrome (232200020002232).
The spelling of 112000010002021 in words is "one hundred twelve trillion, ten million, two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •