Base | Representation |
---|---|
bin | 100101100110001… |
… | …011000011101101 |
3 | 1121221220010012122 |
4 | 211212023003231 |
5 | 2242433420012 |
6 | 142331242325 |
7 | 21426255251 |
oct | 4546130355 |
9 | 1557803178 |
10 | 630763757 |
11 | 2a4060168 |
12 | 1572a93a5 |
13 | a08aa3c0 |
14 | 5dab4261 |
15 | 3a597e72 |
hex | 2598b0ed |
630763757 has 8 divisors (see below), whose sum is σ = 682106040. Its totient is φ = 579824640.
The previous prime is 630763741. The next prime is 630763769. The reversal of 630763757 is 757367036.
It is a happy number.
630763757 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 241056676 + 389707081 = 15526^2 + 19741^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 630763757 - 24 = 630763741 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (630763057) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 97532 + ... + 103797.
It is an arithmetic number, because the mean of its divisors is an integer number (85263255).
Almost surely, 2630763757 is an apocalyptic number.
It is an amenable number.
630763757 is a deficient number, since it is larger than the sum of its proper divisors (51342283).
630763757 is a wasteful number, since it uses less digits than its factorization.
630763757 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 201583.
The product of its (nonzero) digits is 555660, while the sum is 44.
The square root of 630763757 is about 25115.0105912779. The cubic root of 630763757 is about 857.6081714921.
The spelling of 630763757 in words is "six hundred thirty million, seven hundred sixty-three thousand, seven hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •