Base | Representation |
---|---|
bin | 110011010010001000… |
… | …1000000001011111001 |
3 | 101112021011012220011221 |
4 | 1212210101000023321 |
5 | 3301021301244113 |
6 | 122332034152041 |
7 | 10646061300406 |
oct | 1464421001371 |
9 | 345234186157 |
10 | 110130103033 |
11 | 42784632485 |
12 | 19416422621 |
13 | a501450552 |
14 | 548a5ad2ad |
15 | 2ce874698d |
hex | 19a44402f9 |
110130103033 has 2 divisors, whose sum is σ = 110130103034. Its totient is φ = 110130103032.
The previous prime is 110130103021. The next prime is 110130103037. The reversal of 110130103033 is 330301031011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 104414289424 + 5715813609 = 323132^2 + 75603^2 .
It is a cyclic number.
It is not a de Polignac number, because 110130103033 - 217 = 110129971961 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 110130102998 and 110130103016.
It is not a weakly prime, because it can be changed into another prime (110130103037) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55065051516 + 55065051517.
It is an arithmetic number, because the mean of its divisors is an integer number (55065051517).
Almost surely, 2110130103033 is an apocalyptic number.
It is an amenable number.
110130103033 is a deficient number, since it is larger than the sum of its proper divisors (1).
110130103033 is an equidigital number, since it uses as much as digits as its factorization.
110130103033 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 16.
Adding to 110130103033 its reverse (330301031011), we get a palindrome (440431134044).
The spelling of 110130103033 in words is "one hundred ten billion, one hundred thirty million, one hundred three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •