Base | Representation |
---|---|
bin | 100101100011111… |
… | …111001111000001 |
3 | 1121220211000120221 |
4 | 211203333033001 |
5 | 2242312103131 |
6 | 142311103041 |
7 | 21421351444 |
oct | 4543771701 |
9 | 1556730527 |
10 | 630191041 |
11 | 2a37a9947 |
12 | 157071a81 |
13 | a073980c |
14 | 5d9a565b |
15 | 3a4d3411 |
hex | 258ff3c1 |
630191041 has 4 divisors (see below), whose sum is σ = 642081492. Its totient is φ = 618300592.
The previous prime is 630191039. The next prime is 630191059. The reversal of 630191041 is 140191036.
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 420086016 + 210105025 = 20496^2 + 14495^2 .
It is a cyclic number.
It is not a de Polignac number, because 630191041 - 21 = 630191039 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 630190997 and 630191015.
It is not an unprimeable number, because it can be changed into a prime (630161041) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5945146 + ... + 5945251.
It is an arithmetic number, because the mean of its divisors is an integer number (160520373).
Almost surely, 2630191041 is an apocalyptic number.
It is an amenable number.
630191041 is a deficient number, since it is larger than the sum of its proper divisors (11890451).
630191041 is a wasteful number, since it uses less digits than its factorization.
630191041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11890450.
The product of its (nonzero) digits is 648, while the sum is 25.
The square root of 630191041 is about 25103.6061353743. The cubic root of 630191041 is about 857.3485314150.
The spelling of 630191041 in words is "six hundred thirty million, one hundred ninety-one thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •