Base | Representation |
---|---|
bin | 1101001000000… |
… | …10110100111101 |
3 | 21200012021100111 |
4 | 12210002310331 |
5 | 211142041221 |
6 | 14532030021 |
7 | 2504636263 |
oct | 644026475 |
9 | 250167314 |
10 | 110112061 |
11 | 57178904 |
12 | 30a62311 |
13 | 19a74387 |
14 | 108a4433 |
15 | 9a00be1 |
hex | 6902d3d |
110112061 has 2 divisors, whose sum is σ = 110112062. Its totient is φ = 110112060.
The previous prime is 110111923. The next prime is 110112071. The reversal of 110112061 is 160211011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 90839961 + 19272100 = 9531^2 + 4390^2 .
It is an emirp because it is prime and its reverse (160211011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 110112061 - 225 = 76557629 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110112071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55056030 + 55056031.
It is an arithmetic number, because the mean of its divisors is an integer number (55056031).
Almost surely, 2110112061 is an apocalyptic number.
It is an amenable number.
110112061 is a deficient number, since it is larger than the sum of its proper divisors (1).
110112061 is an equidigital number, since it uses as much as digits as its factorization.
110112061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 13.
The square root of 110112061 is about 10493.4294203563. The cubic root of 110112061 is about 479.3046369406.
Adding to 110112061 its reverse (160211011), we get a palindrome (270323072).
The spelling of 110112061 in words is "one hundred ten million, one hundred twelve thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •