Base | Representation |
---|---|
bin | 10000011111001… |
… | …111101001111001 |
3 | 201021112001120221 |
4 | 100133033221321 |
5 | 1031304013131 |
6 | 43241020041 |
7 | 6566165626 |
oct | 2037175171 |
9 | 637461527 |
10 | 276626041 |
11 | 13216a26a |
12 | 78784621 |
13 | 45405a63 |
14 | 28a4b34d |
15 | 19443411 |
hex | 107cfa79 |
276626041 has 4 divisors (see below), whose sum is σ = 286164900. Its totient is φ = 267087184.
The previous prime is 276626039. The next prime is 276626047. The reversal of 276626041 is 140626672.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 139736041 + 136890000 = 11821^2 + 11700^2 .
It is a cyclic number.
It is not a de Polignac number, because 276626041 - 21 = 276626039 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 276625988 and 276626006.
It is not an unprimeable number, because it can be changed into a prime (276626047) 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 3 ways as a sum of consecutive naturals, for example, 4769386 + ... + 4769443.
It is an arithmetic number, because the mean of its divisors is an integer number (71541225).
Almost surely, 2276626041 is an apocalyptic number.
It is an amenable number.
276626041 is a deficient number, since it is larger than the sum of its proper divisors (9538859).
276626041 is an equidigital number, since it uses as much as digits as its factorization.
276626041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9538858.
The product of its (nonzero) digits is 24192, while the sum is 34.
The square root of 276626041 is about 16632.0786734551. The cubic root of 276626041 is about 651.5749115724.
The spelling of 276626041 in words is "two hundred seventy-six million, six hundred twenty-six thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •