Base | Representation |
---|---|
bin | 100101100011110… |
… | …000010101111001 |
3 | 1121220200220220200 |
4 | 211203300111321 |
5 | 2242303130131 |
6 | 142305512413 |
7 | 21421005552 |
oct | 4543602571 |
9 | 1556626820 |
10 | 630130041 |
11 | 2a3768032 |
12 | 157042709 |
13 | a0717b18 |
14 | 5d98b329 |
15 | 3a4c02e6 |
hex | 258f0579 |
630130041 has 72 divisors (see below), whose sum is σ = 1052868960. Its totient is φ = 360702720.
The previous prime is 630130037. The next prime is 630130051. The reversal of 630130041 is 140031036.
630130041 is a `hidden beast` number, since 630 + 1 + 30 + 0 + 4 + 1 = 666.
630130041 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 630130041 - 22 = 630130037 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 630129996 and 630130023.
It is not an unprimeable number, because it can be changed into a prime (630130021) by changing a digit.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 8875036 + ... + 8875106.
It is an arithmetic number, because the mean of its divisors is an integer number (14623180).
Almost surely, 2630130041 is an apocalyptic number.
It is an amenable number.
630130041 is a deficient number, since it is larger than the sum of its proper divisors (422738919).
630130041 is a wasteful number, since it uses less digits than its factorization.
630130041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 227 (or 153 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
The square root of 630130041 is about 25102.3911410845. The cubic root of 630130041 is about 857.3208678736.
Adding to 630130041 its reverse (140031036), we get a palindrome (770161077).
The spelling of 630130041 in words is "six hundred thirty million, one hundred thirty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •