Base | Representation |
---|---|
bin | 11001000100000011110111… |
… | …111010100111100001001001 |
3 | 112110021220102011111121010001 |
4 | 121010003313322213201021 |
5 | 103422002422201214423 |
6 | 1030235015501123001 |
7 | 32134604054444302 |
oct | 3104036772474111 |
9 | 473256364447101 |
10 | 110230200023113 |
11 | 32139402243785 |
12 | 10443426b59461 |
13 | 496788124a3a1 |
14 | 1d31254c577a9 |
15 | cb2519121cad |
hex | 6440f7ea7849 |
110230200023113 has 2 divisors, whose sum is σ = 110230200023114. Its totient is φ = 110230200023112.
The previous prime is 110230200023011. The next prime is 110230200023123. The reversal of 110230200023113 is 311320002032011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 94584124840969 + 15646075182144 = 9725437^2 + 3955512^2 .
It is a cyclic number.
It is not a de Polignac number, because 110230200023113 - 221 = 110230197925961 is a prime.
It is not a weakly prime, because it can be changed into another prime (110230200023123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55115100011556 + 55115100011557.
It is an arithmetic number, because the mean of its divisors is an integer number (55115100011557).
Almost surely, 2110230200023113 is an apocalyptic number.
It is an amenable number.
110230200023113 is a deficient number, since it is larger than the sum of its proper divisors (1).
110230200023113 is an equidigital number, since it uses as much as digits as its factorization.
110230200023113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 110230200023113 its reverse (311320002032011), we get a palindrome (421550202055124).
The spelling of 110230200023113 in words is "one hundred ten trillion, two hundred thirty billion, two hundred million, twenty-three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •