Base | Representation |
---|---|
bin | 11101011010101… |
… | …111011000100101 |
3 | 1021101200220002001 |
4 | 131122233120211 |
5 | 2002322032333 |
6 | 120550245301 |
7 | 15142045432 |
oct | 3532573045 |
9 | 1241626061 |
10 | 493549093 |
11 | 233660814 |
12 | 119356831 |
13 | 7b336aab |
14 | 49796b89 |
15 | 2d4e1b7d |
hex | 1d6af625 |
493549093 has 2 divisors, whose sum is σ = 493549094. Its totient is φ = 493549092.
The previous prime is 493549039. The next prime is 493549097. The reversal of 493549093 is 390945394.
Together with previous prime (493549039) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 434597409 + 58951684 = 20847^2 + 7678^2 .
It is a cyclic number.
It is not a de Polignac number, because 493549093 - 217 = 493418021 is a prime.
It is a super-2 number, since 2×4935490932 = 487181414402245298, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (493549097) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 246774546 + 246774547.
It is an arithmetic number, because the mean of its divisors is an integer number (246774547).
Almost surely, 2493549093 is an apocalyptic number.
It is an amenable number.
493549093 is a deficient number, since it is larger than the sum of its proper divisors (1).
493549093 is an equidigital number, since it uses as much as digits as its factorization.
493549093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 524880, while the sum is 46.
The square root of 493549093 is about 22215.9648226225. The cubic root of 493549093 is about 790.2723480151.
The spelling of 493549093 in words is "four hundred ninety-three million, five hundred forty-nine thousand, ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •