Base | Representation |
---|---|
bin | 11001000010010101110011… |
… | …010011101010010010001001 |
3 | 112102212121100101012021212021 |
4 | 121002111303103222102021 |
5 | 103413033344320220241 |
6 | 1030104432022244441 |
7 | 32123221166256265 |
oct | 3102256323522211 |
9 | 472777311167767 |
10 | 110112011101321 |
11 | 320a327271a509 |
12 | 10424541886721 |
13 | 4959697331638 |
14 | 1d2964226d0a5 |
15 | cae3ed1620d1 |
hex | 6425734ea489 |
110112011101321 has 2 divisors, whose sum is σ = 110112011101322. Its totient is φ = 110112011101320.
The previous prime is 110112011101291. The next prime is 110112011101427. The reversal of 110112011101321 is 123101110211011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 71854866725625 + 38257144375696 = 8476725^2 + 6185236^2 .
It is a cyclic number.
It is not a de Polignac number, because 110112011101321 - 213 = 110112011093129 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110112011101295 and 110112011101304.
It is not a weakly prime, because it can be changed into another prime (110112051101321) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55056005550660 + 55056005550661.
It is an arithmetic number, because the mean of its divisors is an integer number (55056005550661).
Almost surely, 2110112011101321 is an apocalyptic number.
It is an amenable number.
110112011101321 is a deficient number, since it is larger than the sum of its proper divisors (1).
110112011101321 is an equidigital number, since it uses as much as digits as its factorization.
110112011101321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 16.
Adding to 110112011101321 its reverse (123101110211011), we get a palindrome (233213121312332).
The spelling of 110112011101321 in words is "one hundred ten trillion, one hundred twelve billion, eleven million, one hundred one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •