Base | Representation |
---|---|
bin | 1010100101100011101100 |
3 | 12012222222000 |
4 | 22211203230 |
5 | 1202302101 |
6 | 135252300 |
7 | 32406120 |
oct | 12454354 |
9 | 5188860 |
10 | 2775276 |
11 | 1626119 |
12 | b1a090 |
13 | 76229a |
14 | 523580 |
15 | 39c486 |
hex | 2a58ec |
2775276 has 48 divisors (see below), whose sum is σ = 8225280. Its totient is φ = 792720.
The previous prime is 2775257. The next prime is 2775277. The reversal of 2775276 is 6725772.
2775276 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-3 number, since 3×27752763 = 64126833380058673728, which contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 2775276.
It is not an unprimeable number, because it can be changed into a prime (2775277) 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 15 ways as a sum of consecutive naturals, for example, 1080 + ... + 2591.
It is an arithmetic number, because the mean of its divisors is an integer number (171360).
22775276 is an apocalyptic number.
It is an amenable number.
2775276 is an abundant number, since it is smaller than the sum of its proper divisors (5450004).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2775276 is a wasteful number, since it uses less digits than its factorization.
2775276 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3691 (or 3683 counting only the distinct ones).
The product of its digits is 41160, while the sum is 36.
The square root of 2775276 is about 1665.9159642671. The cubic root of 2775276 is about 140.5298965858.
The spelling of 2775276 in words is "two million, seven hundred seventy-five thousand, two hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •