Base | Representation |
---|---|
bin | 10000011101110… |
… | …111110110110100 |
3 | 201020211210021122 |
4 | 100131313312310 |
5 | 1031211011140 |
6 | 43225203112 |
7 | 6563140313 |
oct | 2035676664 |
9 | 636753248 |
10 | 276266420 |
11 | 131a44061 |
12 | 78630498 |
13 | 4530b171 |
14 | 2899627a |
15 | 193c1ab5 |
hex | 10777db4 |
276266420 has 48 divisors (see below), whose sum is σ = 615111168. Its totient is φ = 104042880.
The previous prime is 276266407. The next prime is 276266437. The reversal of 276266420 is 24662672.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 16919 + ... + 28961.
It is an arithmetic number, because the mean of its divisors is an integer number (12814816).
Almost surely, 2276266420 is an apocalyptic number.
276266420 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 276266420, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (307555584).
276266420 is an abundant number, since it is smaller than the sum of its proper divisors (338844748).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
276266420 is a wasteful number, since it uses less digits than its factorization.
276266420 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12120 (or 12118 counting only the distinct ones).
The product of its (nonzero) digits is 48384, while the sum is 35.
The square root of 276266420 is about 16621.2640915184. The cubic root of 276266420 is about 651.2924343883.
The spelling of 276266420 in words is "two hundred seventy-six million, two hundred sixty-six thousand, four hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •