Base | Representation |
---|---|
bin | 1101000111100… |
… | …11110011010001 |
3 | 21200002010220221 |
4 | 12203303303101 |
5 | 211133104023 |
6 | 14530433041 |
7 | 2504261656 |
oct | 643636321 |
9 | 250063827 |
10 | 110050513 |
11 | 57136641 |
12 | 30a32781 |
13 | 19a52361 |
14 | 10889c2d |
15 | 99dc85d |
hex | 68f3cd1 |
110050513 has 2 divisors, whose sum is σ = 110050514. Its totient is φ = 110050512.
The previous prime is 110050483. The next prime is 110050529. The reversal of 110050513 is 315050011.
It is an a-pointer prime, because the next prime (110050529) can be obtained adding 110050513 to its sum of digits (16).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 106853569 + 3196944 = 10337^2 + 1788^2 .
It is an emirp because it is prime and its reverse (315050011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 110050513 - 29 = 110050001 is a prime.
It is a super-2 number, since 2×1100505132 = 24222230823126338, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (110050553) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55025256 + 55025257.
It is an arithmetic number, because the mean of its divisors is an integer number (55025257).
Almost surely, 2110050513 is an apocalyptic number.
It is an amenable number.
110050513 is a deficient number, since it is larger than the sum of its proper divisors (1).
110050513 is an equidigital number, since it uses as much as digits as its factorization.
110050513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 75, while the sum is 16.
The square root of 110050513 is about 10490.4963180967. The cubic root of 110050513 is about 479.2153166012.
The spelling of 110050513 in words is "one hundred ten million, fifty thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •