Base | Representation |
---|---|
bin | 11001000101010001000000… |
… | …011011111101000010111111 |
3 | 112110120211012002222020101102 |
4 | 121011101000123331002333 |
5 | 103424332031400201343 |
6 | 1030341034032203315 |
7 | 32143565333130434 |
oct | 3105210033750277 |
9 | 473524162866342 |
10 | 110313021100223 |
11 | 32170542613847 |
12 | 1045749b69953b |
13 | 497261c97bba6 |
14 | 1d35270541b8b |
15 | cb47650e03b8 |
hex | 6454406fd0bf |
110313021100223 has 2 divisors, whose sum is σ = 110313021100224. Its totient is φ = 110313021100222.
The previous prime is 110313021100199. The next prime is 110313021100253. The reversal of 110313021100223 is 322001120313011.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110313021100223 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110313021100195 and 110313021100204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110313021100253) 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, 55156510550111 + 55156510550112.
It is an arithmetic number, because the mean of its divisors is an integer number (55156510550112).
Almost surely, 2110313021100223 is an apocalyptic number.
110313021100223 is a deficient number, since it is larger than the sum of its proper divisors (1).
110313021100223 is an equidigital number, since it uses as much as digits as its factorization.
110313021100223 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 20.
Adding to 110313021100223 its reverse (322001120313011), we get a palindrome (432314141413234).
The spelling of 110313021100223 in words is "one hundred ten trillion, three hundred thirteen billion, twenty-one million, one hundred thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •