Base | Representation |
---|---|
bin | 10000011100110… |
… | …110110101001011 |
3 | 201020100020221000 |
4 | 100130312311023 |
5 | 1031124000300 |
6 | 43215350043 |
7 | 6560650641 |
oct | 2034666513 |
9 | 636306830 |
10 | 276000075 |
11 | 131881a3a |
12 | 78522323 |
13 | 45246b70 |
14 | 28927191 |
15 | 1936cc00 |
hex | 10736d4b |
276000075 has 96 divisors (see below), whose sum is σ = 554964480. Its totient is φ = 133660800.
The previous prime is 276000073. The next prime is 276000091. The reversal of 276000075 is 570000672.
It is not a de Polignac number, because 276000075 - 21 = 276000073 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (276000073) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 622804 + ... + 623246.
It is an arithmetic number, because the mean of its divisors is an integer number (5780880).
Almost surely, 2276000075 is an apocalyptic number.
276000075 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
276000075 is the 8307-th decagonal number.
276000075 is an abundant number, since it is smaller than the sum of its proper divisors (278964405).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
276000075 is a wasteful number, since it uses less digits than its factorization.
276000075 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 546 (or 535 counting only the distinct ones).
The product of its (nonzero) digits is 2940, while the sum is 27.
The square root of 276000075 is about 16613.2499830707. The cubic root of 276000075 is about 651.0830661275.
It can be divided in two parts, 2760000 and 75, that added together give a triangular number (2760075 = T2349).
The spelling of 276000075 in words is "two hundred seventy-six million, seventy-five", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •