Base | Representation |
---|---|
bin | 100111100001101… |
… | …001001011011001 |
3 | 1201012210112111112 |
4 | 213201221023121 |
5 | 2324230141331 |
6 | 145445110105 |
7 | 22301343032 |
oct | 4741511331 |
9 | 1635715445 |
10 | 663130841 |
11 | 31035801a |
12 | 1660b8335 |
13 | a7500919 |
14 | 640dba89 |
15 | 3d33d32b |
hex | 278692d9 |
663130841 has 4 divisors (see below), whose sum is σ = 672470784. Its totient is φ = 653790900.
The previous prime is 663130813. The next prime is 663130873. The reversal of 663130841 is 148031366.
663130841 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 a de Polignac number, because none of the positive numbers 2k-663130841 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 663130798 and 663130807.
It is not an unprimeable number, because it can be changed into a prime (663130801) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4669865 + ... + 4670006.
It is an arithmetic number, because the mean of its divisors is an integer number (168117696).
Almost surely, 2663130841 is an apocalyptic number.
It is an amenable number.
663130841 is a deficient number, since it is larger than the sum of its proper divisors (9339943).
663130841 is an equidigital number, since it uses as much as digits as its factorization.
663130841 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9339942.
The product of its (nonzero) digits is 10368, while the sum is 32.
The square root of 663130841 is about 25751.3269755172. The cubic root of 663130841 is about 872.0333121585.
The spelling of 663130841 in words is "six hundred sixty-three million, one hundred thirty thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •