Base | Representation |
---|---|
bin | 10000011101111… |
… | …010101111101010 |
3 | 201020212101111210 |
4 | 100131322233222 |
5 | 1031211401000 |
6 | 43225333550 |
7 | 6563216643 |
oct | 2035725752 |
9 | 636771453 |
10 | 276278250 |
11 | 131a51a36 |
12 | 786372b6 |
13 | 45313671 |
14 | 2899a6ca |
15 | 193c5350 |
hex | 1077abea |
276278250 has 64 divisors (see below), whose sum is σ = 697507200. Its totient is φ = 72828800.
The previous prime is 276278243. The next prime is 276278251. The reversal of 276278250 is 52872672.
It is a junction number, because it is equal to n+sod(n) for n = 276278199 and 276278208.
It is not an unprimeable number, because it can be changed into a prime (276278251) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 64681 + ... + 68819.
It is an arithmetic number, because the mean of its divisors is an integer number (10898550).
Almost surely, 2276278250 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 276278250, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (348753600).
276278250 is an abundant number, since it is smaller than the sum of its proper divisors (421228950).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
276278250 is a wasteful number, since it uses less digits than its factorization.
276278250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4248 (or 4238 counting only the distinct ones).
The product of its (nonzero) digits is 94080, while the sum is 39.
The square root of 276278250 is about 16621.6199571522. The cubic root of 276278250 is about 651.3017305833.
The spelling of 276278250 in words is "two hundred seventy-six million, two hundred seventy-eight thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •