Base | Representation |
---|---|
bin | 110011010010011110… |
… | …0111100111101001001 |
3 | 101112021221220020011111 |
4 | 1212210330330331021 |
5 | 3301032223433022 |
6 | 122333125130321 |
7 | 10646261233546 |
oct | 1464474747511 |
9 | 345257806144 |
10 | 110141624137 |
11 | 42790091456 |
12 | 1941a2599a1 |
13 | a50395557c |
14 | 548bd2bbcd |
15 | 2ce9770477 |
hex | 19a4f3cf49 |
110141624137 has 2 divisors, whose sum is σ = 110141624138. Its totient is φ = 110141624136.
The previous prime is 110141624101. The next prime is 110141624249. The reversal of 110141624137 is 731426141011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 109653037321 + 488586816 = 331139^2 + 22104^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110141624137 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110141624099 and 110141624108.
It is not a weakly prime, because it can be changed into another prime (110141622137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55070812068 + 55070812069.
It is an arithmetic number, because the mean of its divisors is an integer number (55070812069).
Almost surely, 2110141624137 is an apocalyptic number.
It is an amenable number.
110141624137 is a deficient number, since it is larger than the sum of its proper divisors (1).
110141624137 is an equidigital number, since it uses as much as digits as its factorization.
110141624137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4032, while the sum is 31.
Adding to 110141624137 its reverse (731426141011), we get a palindrome (841567765148).
The spelling of 110141624137 in words is "one hundred ten billion, one hundred forty-one million, six hundred twenty-four thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •