Base | Representation |
---|---|
bin | 110011010100100011… |
… | …0011100001001000001 |
3 | 101112110210212001210021 |
4 | 1212221012130021001 |
5 | 3301203033020113 |
6 | 122344052533441 |
7 | 10651064625205 |
oct | 1465106341101 |
9 | 345423761707 |
10 | 110211220033 |
11 | 428163a6922 |
12 | 19439621281 |
13 | a5151b2185 |
14 | 5497286b05 |
15 | 2d0091b48d |
hex | 19a919c241 |
110211220033 has 2 divisors, whose sum is σ = 110211220034. Its totient is φ = 110211220032.
The previous prime is 110211220019. The next prime is 110211220043. The reversal of 110211220033 is 330022112011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 67876923024 + 42334297009 = 260532^2 + 205753^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110211220033 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110211219989 and 110211220016.
It is not a weakly prime, because it can be changed into another prime (110211220043) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55105610016 + 55105610017.
It is an arithmetic number, because the mean of its divisors is an integer number (55105610017).
Almost surely, 2110211220033 is an apocalyptic number.
It is an amenable number.
110211220033 is a deficient number, since it is larger than the sum of its proper divisors (1).
110211220033 is an equidigital number, since it uses as much as digits as its factorization.
110211220033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 16.
Adding to 110211220033 its reverse (330022112011), we get a palindrome (440233332044).
The spelling of 110211220033 in words is "one hundred ten billion, two hundred eleven million, two hundred twenty thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •