Base | Representation |
---|---|
bin | 11001011101111110011101… |
… | …111000110001111110101001 |
3 | 112200121011020012220212210202 |
4 | 121131332131320301332221 |
5 | 104140142213330120243 |
6 | 1034121104530121545 |
7 | 32410351334241623 |
oct | 3135763570617651 |
9 | 480534205825722 |
10 | 112011101020073 |
11 | 32765706447732 |
12 | 106906031202b5 |
13 | 4a667a8670058 |
14 | 1d9351ac79c13 |
15 | ce39ec0864b8 |
hex | 65df9de31fa9 |
112011101020073 has 2 divisors, whose sum is σ = 112011101020074. Its totient is φ = 112011101020072.
The previous prime is 112011101020069. The next prime is 112011101020207. The reversal of 112011101020073 is 370020101110211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 100227589345129 + 11783511674944 = 10011373^2 + 3432712^2 .
It is a cyclic number.
It is not a de Polignac number, because 112011101020073 - 22 = 112011101020069 is a prime.
It is a super-2 number, since 2×1120111010200732 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (112011101020873) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56005550510036 + 56005550510037.
It is an arithmetic number, because the mean of its divisors is an integer number (56005550510037).
Almost surely, 2112011101020073 is an apocalyptic number.
It is an amenable number.
112011101020073 is a deficient number, since it is larger than the sum of its proper divisors (1).
112011101020073 is an equidigital number, since it uses as much as digits as its factorization.
112011101020073 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 84, while the sum is 20.
Adding to 112011101020073 its reverse (370020101110211), we get a palindrome (482031202130284).
The spelling of 112011101020073 in words is "one hundred twelve trillion, eleven billion, one hundred one million, twenty thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •