Base | Representation |
---|---|
bin | 1110010111101011110… |
… | …01000000001010110001 |
3 | 1202012110101210202111021 |
4 | 13023311321000022301 |
5 | 31042200404220221 |
6 | 1014454255015441 |
7 | 50446424425555 |
oct | 7136571001261 |
9 | 1665411722437 |
10 | 493751632561 |
11 | 180442a19570 |
12 | 7b83850a581 |
13 | 37739791735 |
14 | 19c7d441865 |
15 | cc9c2da041 |
hex | 72f5e402b1 |
493751632561 has 4 divisors (see below), whose sum is σ = 538638144624. Its totient is φ = 448865120500.
The previous prime is 493751632553. The next prime is 493751632597. The reversal of 493751632561 is 165236157394.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 493751632561 - 23 = 493751632553 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 493751632499 and 493751632508.
It is not an unprimeable number, because it can be changed into a prime (493751632531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22443256015 + ... + 22443256036.
It is an arithmetic number, because the mean of its divisors is an integer number (134659536156).
Almost surely, 2493751632561 is an apocalyptic number.
It is an amenable number.
493751632561 is a deficient number, since it is larger than the sum of its proper divisors (44886512063).
493751632561 is a wasteful number, since it uses less digits than its factorization.
493751632561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44886512062.
The product of its digits is 4082400, while the sum is 52.
The spelling of 493751632561 in words is "four hundred ninety-three billion, seven hundred fifty-one million, six hundred thirty-two thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •