Base | Representation |
---|---|
bin | 100111100011110… |
… | …111100001011111 |
3 | 1201020220011021211 |
4 | 213203313201133 |
5 | 2324402321022 |
6 | 145505405251 |
7 | 22306321624 |
oct | 4743674137 |
9 | 1636804254 |
10 | 663713887 |
11 | 310716081 |
12 | 166339827 |
13 | a7676115 |
14 | 6421034b |
15 | 3d405e77 |
hex | 278f785f |
663713887 has 4 divisors (see below), whose sum is σ = 663883776. Its totient is φ = 663544000.
The previous prime is 663713879. The next prime is 663713917. The reversal of 663713887 is 788317366.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 663713887 - 23 = 663713879 is a prime.
It is a super-2 number, since 2×6637138872 = 881032247593297538, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 663713887.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (663713287) 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, 78943 + ... + 86944.
It is an arithmetic number, because the mean of its divisors is an integer number (165970944).
Almost surely, 2663713887 is an apocalyptic number.
663713887 is a deficient number, since it is larger than the sum of its proper divisors (169889).
663713887 is a wasteful number, since it uses less digits than its factorization.
663713887 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 169888.
The product of its digits is 1016064, while the sum is 49.
The square root of 663713887 is about 25762.6451863934. The cubic root of 663713887 is about 872.2888105533.
The spelling of 663713887 in words is "six hundred sixty-three million, seven hundred thirteen thousand, eight hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •