Base | Representation |
---|---|
bin | 10111011001001110010110 |
3 | 102112120101110 |
4 | 113121032112 |
5 | 3032221010 |
6 | 335235450 |
7 | 103061250 |
oct | 27311626 |
9 | 12476343 |
10 | 6132630 |
11 | 3509599 |
12 | 2078b86 |
13 | 136949a |
14 | b58cd0 |
15 | 812120 |
hex | 5d9396 |
6132630 has 128 divisors (see below), whose sum is σ = 18662400. Its totient is φ = 1257984.
The previous prime is 6132593. The next prime is 6132647. The reversal of 6132630 is 362316.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is an Ulam number.
It is a junction number, because it is equal to n+sod(n) for n = 6132597 and 6132606.
It is a congruent number.
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 115684 + ... + 115736.
It is an arithmetic number, because the mean of its divisors is an integer number (145800).
Almost surely, 26132630 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 6132630, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9331200).
6132630 is an abundant number, since it is smaller than the sum of its proper divisors (12529770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6132630 is a wasteful number, since it uses less digits than its factorization.
6132630 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 118.
The product of its (nonzero) digits is 648, while the sum is 21.
The square root of 6132630 is about 2476.4147471698. The cubic root of 6132630 is about 183.0412281322.
Adding to 6132630 its reverse (362316), we get a palindrome (6494946).
The spelling of 6132630 in words is "six million, one hundred thirty-two thousand, six hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •