Base | Representation |
---|---|
bin | 11001011111010011000111… |
… | …111000110111111111111101 |
3 | 112200220211212010101112221202 |
4 | 121133103013320313333331 |
5 | 104143134344000013041 |
6 | 1034230540422505245 |
7 | 32420050030651112 |
oct | 3137230770677775 |
9 | 480824763345852 |
10 | 112102000001021 |
11 | 327a0211564488 |
12 | 106a6150b95225 |
13 | 4a722337bcc04 |
14 | 1d97aa130a909 |
15 | ce606c2dca9b |
hex | 65f4c7e37ffd |
112102000001021 has 2 divisors, whose sum is σ = 112102000001022. Its totient is φ = 112102000001020.
The previous prime is 112102000001011. The next prime is 112102000001059. The reversal of 112102000001021 is 120100000201211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 57495974412100 + 54606025588921 = 7582610^2 + 7389589^2 .
It is a cyclic number.
It is not a de Polignac number, because 112102000001021 - 218 = 112101999738877 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112102000000993 and 112102000001011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112102000001011) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56051000000510 + 56051000000511.
It is an arithmetic number, because the mean of its divisors is an integer number (56051000000511).
Almost surely, 2112102000001021 is an apocalyptic number.
It is an amenable number.
112102000001021 is a deficient number, since it is larger than the sum of its proper divisors (1).
112102000001021 is an equidigital number, since it uses as much as digits as its factorization.
112102000001021 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 112102000001021 its reverse (120100000201211), we get a palindrome (232202000202232).
The spelling of 112102000001021 in words is "one hundred twelve trillion, one hundred two billion, one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •