Base | Representation |
---|---|
bin | 100111100001010… |
… | …001101101000101 |
3 | 1201012121122121111 |
4 | 213201101231011 |
5 | 2324214102233 |
6 | 145443045021 |
7 | 22300462516 |
oct | 4741215505 |
9 | 1635548544 |
10 | 663034693 |
11 | 3102a1862 |
12 | 166070771 |
13 | a7498c29 |
14 | 640b4a0d |
15 | 3d31eacd |
hex | 27851b45 |
663034693 has 4 divisors (see below), whose sum is σ = 663196140. Its totient is φ = 662873248.
The previous prime is 663034609. The next prime is 663034703. The reversal of 663034693 is 396430366.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 329132164 + 333902529 = 18142^2 + 18273^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-663034693 is a prime.
It is a Smith number, since the sum of its digits (40) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (663034093) 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, 74398 + ... + 82831.
It is an arithmetic number, because the mean of its divisors is an integer number (165799035).
Almost surely, 2663034693 is an apocalyptic number.
It is an amenable number.
663034693 is a deficient number, since it is larger than the sum of its proper divisors (161447).
663034693 is a wasteful number, since it uses less digits than its factorization.
663034693 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 161446.
The product of its (nonzero) digits is 209952, while the sum is 40.
The square root of 663034693 is about 25749.4600525914. The cubic root of 663034693 is about 871.9911644624.
The spelling of 663034693 in words is "six hundred sixty-three million, thirty-four thousand, six hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •