Base | Representation |
---|---|
bin | 110011010010010001… |
… | …1101110011101000101 |
3 | 101112021111110020211201 |
4 | 1212210203232131011 |
5 | 3301024030324031 |
6 | 122332331302501 |
7 | 10646151101641 |
oct | 1464443563505 |
9 | 345244406751 |
10 | 110135011141 |
11 | 42787384a71 |
12 | 19417baaa31 |
13 | a50247b55c |
14 | 548b0c9c21 |
15 | 2ce8db5d61 |
hex | 19a48ee745 |
110135011141 has 2 divisors, whose sum is σ = 110135011142. Its totient is φ = 110135011140.
The previous prime is 110135011117. The next prime is 110135011169. The reversal of 110135011141 is 141110531011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 102829890241 + 7305120900 = 320671^2 + 85470^2 .
It is a cyclic number.
It is not a de Polignac number, because 110135011141 - 213 = 110135002949 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110135011541) 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 as a sum of consecutive naturals, namely, 55067505570 + 55067505571.
It is an arithmetic number, because the mean of its divisors is an integer number (55067505571).
Almost surely, 2110135011141 is an apocalyptic number.
It is an amenable number.
110135011141 is a deficient number, since it is larger than the sum of its proper divisors (1).
110135011141 is an equidigital number, since it uses as much as digits as its factorization.
110135011141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 60, while the sum is 19.
Adding to 110135011141 its reverse (141110531011), we get a palindrome (251245542152).
The spelling of 110135011141 in words is "one hundred ten billion, one hundred thirty-five million, eleven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •