Base | Representation |
---|---|
bin | 11001000010110000111000… |
… | …011110100001010000010101 |
3 | 112102222101101212010122102220 |
4 | 121002300320132201100111 |
5 | 103414022422222111003 |
6 | 1030130041231452553 |
7 | 32125300600206360 |
oct | 3102607036412025 |
9 | 472871355118386 |
10 | 110141088863253 |
11 | 32104634322418 |
12 | 1042a0b7987159 |
13 | 495c34c615026 |
14 | 1d2ac0000d0d7 |
15 | cb0050d1a353 |
hex | 642c387a1415 |
110141088863253 has 16 divisors (see below), whose sum is σ = 167859936698496. Its totient is φ = 62928053867520.
The previous prime is 110141088863243. The next prime is 110141088863257. The reversal of 110141088863253 is 352368880141011.
It is not a de Polignac number, because 110141088863253 - 220 = 110141087814677 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110141088863196 and 110141088863205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110141088863257) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 404493876 + ... + 404766077.
It is an arithmetic number, because the mean of its divisors is an integer number (10491246043656).
Almost surely, 2110141088863253 is an apocalyptic number.
It is an amenable number.
110141088863253 is a deficient number, since it is larger than the sum of its proper divisors (57718847835243).
110141088863253 is an equidigital number, since it uses as much as digits as its factorization.
110141088863253 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 809266444.
The product of its (nonzero) digits is 1105920, while the sum is 51.
The spelling of 110141088863253 in words is "one hundred ten trillion, one hundred forty-one billion, eighty-eight million, eight hundred sixty-three thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •