Base | Representation |
---|---|
bin | 100101100100110… |
… | …001100000011101 |
3 | 1121221012111001110 |
4 | 211210301200131 |
5 | 2242340200312 |
6 | 142315332233 |
7 | 21423200001 |
oct | 4544614035 |
9 | 1557174043 |
10 | 630396957 |
11 | 2a392a623 |
12 | 157151079 |
13 | a07ac468 |
14 | 5da1a701 |
15 | 3a52443c |
hex | 2593181d |
630396957 has 4 divisors (see below), whose sum is σ = 840529280. Its totient is φ = 420264636.
The previous prime is 630396929. The next prime is 630396961. The reversal of 630396957 is 759693036.
It is a happy number.
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 de Polignac number, because none of the positive numbers 2k-630396957 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 (630396457) 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 in 3 ways as a sum of consecutive naturals, for example, 105066157 + ... + 105066162.
It is an arithmetic number, because the mean of its divisors is an integer number (210132320).
Almost surely, 2630396957 is an apocalyptic number.
It is an amenable number.
630396957 is a deficient number, since it is larger than the sum of its proper divisors (210132323).
630396957 is a wasteful number, since it uses less digits than its factorization.
630396957 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 210132322.
The product of its (nonzero) digits is 918540, while the sum is 48.
The square root of 630396957 is about 25107.7071235109. The cubic root of 630396957 is about 857.4419012789.
It can be divided in two parts, 63039 and 6957, that added together give a palindrome (69996).
The spelling of 630396957 in words is "six hundred thirty million, three hundred ninety-six thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •