Base | Representation |
---|---|
bin | 111000000111101001110001… |
… | …1101111001100010110001001 |
3 | 2101201210212001122200020111001 |
4 | 1300033103203233030112021 |
5 | 1004200140342012010431 |
6 | 4505511512011135001 |
7 | 205655543652436255 |
oct | 16017234357142611 |
9 | 2351725048606431 |
10 | 493633002063241 |
11 | 133317642751657 |
12 | 47445471744461 |
13 | 18259514015341 |
14 | 89c7d714d5265 |
15 | 3c107d94e5e61 |
hex | 1c0f4e3bcc589 |
493633002063241 has 8 divisors (see below), whose sum is σ = 499632003319680. Its totient is φ = 487635229751952.
The previous prime is 493633002063239. The next prime is 493633002063263. The reversal of 493633002063241 is 142360200336394.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 493633002063241 - 21 = 493633002063239 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 493633002063191 and 493633002063200.
It is not an unprimeable number, because it can be changed into a prime (493633002063541) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 306428050 + ... + 308034763.
It is an arithmetic number, because the mean of its divisors is an integer number (62454000414960).
Almost surely, 2493633002063241 is an apocalyptic number.
It is an amenable number.
493633002063241 is a deficient number, since it is larger than the sum of its proper divisors (5999001256439).
493633002063241 is an equidigital number, since it uses as much as digits as its factorization.
493633002063241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 614472575.
The product of its (nonzero) digits is 1679616, while the sum is 46.
The spelling of 493633002063241 in words is "four hundred ninety-three trillion, six hundred thirty-three billion, two million, sixty-three thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •