Base | Representation |
---|---|
bin | 100111100001001… |
… | …001100000011101 |
3 | 1201012112221112221 |
4 | 213201021200131 |
5 | 2324212013432 |
6 | 145442225341 |
7 | 22300262602 |
oct | 4741114035 |
9 | 1635487487 |
10 | 663001117 |
11 | 310279609 |
12 | 166055251 |
13 | a748686c |
14 | 640a66a9 |
15 | 3d314b97 |
hex | 2784981d |
663001117 has 2 divisors, whose sum is σ = 663001118. Its totient is φ = 663001116.
The previous prime is 663001099. The next prime is 663001121. The reversal of 663001117 is 711100366.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 650709081 + 12292036 = 25509^2 + 3506^2 .
It is a cyclic number.
It is not a de Polignac number, because 663001117 - 223 = 654612509 is a prime.
It is a super-2 number, since 2×6630011172 = 879140962286495378, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 663001091 and 663001100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (663001177) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 331500558 + 331500559.
It is an arithmetic number, because the mean of its divisors is an integer number (331500559).
Almost surely, 2663001117 is an apocalyptic number.
It is an amenable number.
663001117 is a deficient number, since it is larger than the sum of its proper divisors (1).
663001117 is an equidigital number, since it uses as much as digits as its factorization.
663001117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 756, while the sum is 25.
The square root of 663001117 is about 25748.8080695010. The cubic root of 663001117 is about 871.9764450368.
The spelling of 663001117 in words is "six hundred sixty-three million, one thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •