Base | Representation |
---|---|
bin | 110011010010001010… |
… | …1100101001110000101 |
3 | 101112021020110212122022 |
4 | 1212210111211032011 |
5 | 3301022103201201 |
6 | 122332120012525 |
7 | 10646104426625 |
oct | 1464425451605 |
9 | 345236425568 |
10 | 110131303301 |
11 | 42785282238 |
12 | 19416901145 |
13 | a501780976 |
14 | 548a802885 |
15 | 2ce88d241b |
hex | 19a4565385 |
110131303301 has 2 divisors, whose sum is σ = 110131303302. Its totient is φ = 110131303300.
The previous prime is 110131303279. The next prime is 110131303313. The reversal of 110131303301 is 103303131011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 69274766401 + 40856536900 = 263201^2 + 202130^2 .
It is a cyclic number.
It is not a de Polignac number, because 110131303301 - 218 = 110131041157 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 110131303301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110131302301) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55065651650 + 55065651651.
It is an arithmetic number, because the mean of its divisors is an integer number (55065651651).
Almost surely, 2110131303301 is an apocalyptic number.
It is an amenable number.
110131303301 is a deficient number, since it is larger than the sum of its proper divisors (1).
110131303301 is an equidigital number, since it uses as much as digits as its factorization.
110131303301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 81, while the sum is 17.
Adding to 110131303301 its reverse (103303131011), we get a palindrome (213434434312).
The spelling of 110131303301 in words is "one hundred ten billion, one hundred thirty-one million, three hundred three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •