Base | Representation |
---|---|
bin | 11001000010010101111011… |
… | …000011101110000111111111 |
3 | 112102212121200102212222001101 |
4 | 121002111323003232013333 |
5 | 103413034131112443404 |
6 | 1030104452545353531 |
7 | 32123224335502222 |
oct | 3102257303560777 |
9 | 472777612788041 |
10 | 110112141140479 |
11 | 320a332a068895 |
12 | 104245793388a7 |
13 | 49596b8261b9a |
14 | 1d2965563d5b9 |
15 | cae40979c2a4 |
hex | 64257b0ee1ff |
110112141140479 has 2 divisors, whose sum is σ = 110112141140480. Its totient is φ = 110112141140478.
The previous prime is 110112141140333. The next prime is 110112141140483. The reversal of 110112141140479 is 974041141211011.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 110112141140479 - 217 = 110112141009407 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110112141140579) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55056070570239 + 55056070570240.
It is an arithmetic number, because the mean of its divisors is an integer number (55056070570240).
Almost surely, 2110112141140479 is an apocalyptic number.
110112141140479 is a deficient number, since it is larger than the sum of its proper divisors (1).
110112141140479 is an equidigital number, since it uses as much as digits as its factorization.
110112141140479 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8064, while the sum is 37.
The spelling of 110112141140479 in words is "one hundred ten trillion, one hundred twelve billion, one hundred forty-one million, one hundred forty thousand, four hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •