Base | Representation |
---|---|
bin | 11001000010100110101011… |
… | …011101111110110101000001 |
3 | 112102221100010100010022001101 |
4 | 121002212223131332311001 |
5 | 103413333003044401233 |
6 | 1030121030145534401 |
7 | 32124432236463631 |
oct | 3102465335766501 |
9 | 472840110108041 |
10 | 110130133200193 |
11 | 320aaa22117627 |
12 | 10427b5a944401 |
13 | 495b2c4942272 |
14 | 1d2a480da06c1 |
15 | caeb0e0d7c7d |
hex | 6429ab77ed41 |
110130133200193 has 2 divisors, whose sum is σ = 110130133200194. Its totient is φ = 110130133200192.
The previous prime is 110130133200179. The next prime is 110130133200229. The reversal of 110130133200193 is 391002331031011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 109276665788304 + 853467411889 = 10453548^2 + 923833^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110130133200193 is a prime.
It is not a weakly prime, because it can be changed into another prime (110130133200793) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55065066600096 + 55065066600097.
It is an arithmetic number, because the mean of its divisors is an integer number (55065066600097).
Almost surely, 2110130133200193 is an apocalyptic number.
It is an amenable number.
110130133200193 is a deficient number, since it is larger than the sum of its proper divisors (1).
110130133200193 is an equidigital number, since it uses as much as digits as its factorization.
110130133200193 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1458, while the sum is 28.
The spelling of 110130133200193 in words is "one hundred ten trillion, one hundred thirty billion, one hundred thirty-three million, two hundred thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •