Base | Representation |
---|---|
bin | 10000011101010… |
… | …000101110001101 |
3 | 201020112122101210 |
4 | 100131100232031 |
5 | 1031140344000 |
6 | 43221525033 |
7 | 6561602061 |
oct | 2035205615 |
9 | 636478353 |
10 | 276106125 |
11 | 131944689 |
12 | 78573779 |
13 | 45283209 |
14 | 28953aa1 |
15 | 1938e350 |
hex | 10750b8d |
276106125 has 32 divisors (see below), whose sum is σ = 462833280. Its totient is φ = 146169600.
The previous prime is 276106123. The next prime is 276106133. The reversal of 276106125 is 521601672.
It is not a de Polignac number, because 276106125 - 21 = 276106123 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 276106092 and 276106101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (276106123) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 49477 + ... + 54773.
It is an arithmetic number, because the mean of its divisors is an integer number (14463540).
Almost surely, 2276106125 is an apocalyptic number.
276106125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
276106125 is a deficient number, since it is larger than the sum of its proper divisors (186727155).
276106125 is a wasteful number, since it uses less digits than its factorization.
276106125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5454 (or 5444 counting only the distinct ones).
The product of its (nonzero) digits is 5040, while the sum is 30.
The square root of 276106125 is about 16616.4414060292. The cubic root of 276106125 is about 651.1664459569.
Adding to 276106125 its reverse (521601672), we get a palindrome (797707797).
The spelling of 276106125 in words is "two hundred seventy-six million, one hundred six thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •