Base | Representation |
---|---|
bin | 11001011110000111110111… |
… | …111001100010000100111111 |
3 | 112200122010022010000011022112 |
4 | 121132013313321202010333 |
5 | 104140323404440213434 |
6 | 1034125455050004235 |
7 | 32411156535434222 |
oct | 3136076771420477 |
9 | 480563263004275 |
10 | 112021201101119 |
11 | 32769a196a9052 |
12 | 1069256171667b |
13 | 4a67727ccbb7b |
14 | 1d93bd84115b9 |
15 | ce3dddb12dce |
hex | 65e1f7e6213f |
112021201101119 has 2 divisors, whose sum is σ = 112021201101120. Its totient is φ = 112021201101118.
The previous prime is 112021201101077. The next prime is 112021201101151. The reversal of 112021201101119 is 911101102120211.
It is a strong prime.
It is an emirp because it is prime and its reverse (911101102120211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 112021201101119 - 224 = 112021184323903 is a prime.
It is a super-2 number, since 2×1120212011011192 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 112021201101094 and 112021201101103.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112021201161119) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56010600550559 + 56010600550560.
It is an arithmetic number, because the mean of its divisors is an integer number (56010600550560).
Almost surely, 2112021201101119 is an apocalyptic number.
112021201101119 is a deficient number, since it is larger than the sum of its proper divisors (1).
112021201101119 is an equidigital number, since it uses as much as digits as its factorization.
112021201101119 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 72, while the sum is 23.
The spelling of 112021201101119 in words is "one hundred twelve trillion, twenty-one billion, two hundred one million, one hundred one thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •