Base | Representation |
---|---|
bin | 100101100101010… |
… | …010001111001110 |
3 | 1121221110021221211 |
4 | 211211102033032 |
5 | 2242403443042 |
6 | 142322245034 |
7 | 21424265602 |
oct | 4545221716 |
9 | 1557407854 |
10 | 630531022 |
11 | 2a3a11320 |
12 | 1571b677a |
13 | a08284a4 |
14 | 5da53502 |
15 | 3a54e017 |
hex | 259523ce |
630531022 has 8 divisors (see below), whose sum is σ = 1031778072. Its totient is φ = 286605000.
The previous prime is 630531007. The next prime is 630531047. The reversal of 630531022 is 220135036.
630531022 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a Harshad number since it is a multiple of its sum of digits (22), and also a Moran number because the ratio is a prime number: 28660501 = 630531022 / (6 + 3 + 0 + 5 + 3 + 1 + 0 + 2 + 2).
It is a junction number, because it is equal to n+sod(n) for n = 630530984 and 630531002.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14330229 + ... + 14330272.
It is an arithmetic number, because the mean of its divisors is an integer number (128972259).
Almost surely, 2630531022 is an apocalyptic number.
630531022 is a deficient number, since it is larger than the sum of its proper divisors (401247050).
630531022 is a wasteful number, since it uses less digits than its factorization.
630531022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28660514.
The product of its (nonzero) digits is 1080, while the sum is 22.
The square root of 630531022 is about 25110.3767793317. The cubic root of 630531022 is about 857.5026803374.
Adding to 630531022 its reverse (220135036), we get a palindrome (850666058).
The spelling of 630531022 in words is "six hundred thirty million, five hundred thirty-one thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •