Base | Representation |
---|---|
bin | 11001000001010101100010… |
… | …110001001001001110000101 |
3 | 112102122000020212020112111012 |
4 | 121001111202301021032011 |
5 | 103410421043110001210 |
6 | 1030013021322052005 |
7 | 32115226321630064 |
oct | 3101254261111605 |
9 | 472560225215435 |
10 | 110043014140805 |
11 | 32076a86737899 |
12 | 104130a694a005 |
13 | 495301c949795 |
14 | 1d261789561db |
15 | cac710b33305 |
hex | 641562c49385 |
110043014140805 has 16 divisors (see below), whose sum is σ = 134290814034240. Its totient is φ = 86541636248832.
The previous prime is 110043014140789. The next prime is 110043014140817. The reversal of 110043014140805 is 508041410340011.
It is not a de Polignac number, because 110043014140805 - 24 = 110043014140789 is a prime.
It is a super-2 number, since 2×1100430141408052 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
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, 38851382 + ... + 41587448.
It is an arithmetic number, because the mean of its divisors is an integer number (8393175877140).
Almost surely, 2110043014140805 is an apocalyptic number.
It is an amenable number.
110043014140805 is a deficient number, since it is larger than the sum of its proper divisors (24247799893435).
110043014140805 is a wasteful number, since it uses less digits than its factorization.
110043014140805 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2872468.
The product of its (nonzero) digits is 7680, while the sum is 32.
Adding to 110043014140805 its reverse (508041410340011), we get a palindrome (618084424480816).
The spelling of 110043014140805 in words is "one hundred ten trillion, forty-three billion, fourteen million, one hundred forty thousand, eight hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •