Base | Representation |
---|---|
bin | 1010000010000111101111 |
3 | 11221121212010 |
4 | 22002013233 |
5 | 1133131002 |
6 | 132212303 |
7 | 31233003 |
oct | 12020757 |
9 | 4847763 |
10 | 2630127 |
11 | 1537065 |
12 | a6a093 |
13 | 7111b6 |
14 | 4c6703 |
15 | 36e46c |
hex | 2821ef |
2630127 has 8 divisors (see below), whose sum is σ = 3519360. Its totient is φ = 1747160.
The previous prime is 2630107. The next prime is 2630129. The reversal of 2630127 is 7210362.
It is a happy number.
2630127 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 cyclic number.
It is not a de Polignac number, because 2630127 - 210 = 2629103 is a prime.
It is a super-2 number, since 2×26301272 = 13835136072258, which contains 22 as substring.
2630127 is a lucky number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2630129) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 477 + ... + 2342.
It is an arithmetic number, because the mean of its divisors is an integer number (439920).
22630127 is an apocalyptic number.
2630127 is a deficient number, since it is larger than the sum of its proper divisors (889233).
2630127 is a wasteful number, since it uses less digits than its factorization.
2630127 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3133.
The product of its (nonzero) digits is 504, while the sum is 21.
The square root of 2630127 is about 1621.7666293274. The cubic root of 2630127 is about 138.0359599629.
Adding to 2630127 its reverse (7210362), we get a palindrome (9840489).
The spelling of 2630127 in words is "two million, six hundred thirty thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •