Base | Representation |
---|---|
bin | 1000000010100100010… |
… | …10100100111001000001 |
3 | 222102001210011202002101 |
4 | 10001102022210321001 |
5 | 14011233120124301 |
6 | 330524353350401 |
7 | 25646614515361 |
oct | 4012212447101 |
9 | 872053152071 |
10 | 276256411201 |
11 | a71835a6641 |
12 | 45659868401 |
13 | 200879ab194 |
14 | d5299b09a1 |
15 | 72bce6b701 |
hex | 40522a4e41 |
276256411201 has 27 divisors (see below), whose sum is σ = 289055296803. Its totient is φ = 264019894320.
The previous prime is 276256411157. The next prime is 276256411243. The reversal of 276256411201 is 102114652672.
The square root of 276256411201 is 525601.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 199152450225 + 77103960976 = 446265^2 + 277676^2 .
It is not a de Polignac number, because 276256411201 - 27 = 276256411073 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (276256411271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 1309271986 + ... + 1309272196.
Almost surely, 2276256411201 is an apocalyptic number.
276256411201 is the 525601-st square number.
276256411201 is the 262801-st centered octagonal number.
It is an amenable number.
276256411201 is a deficient number, since it is larger than the sum of its proper divisors (12798885602).
276256411201 is an frugal number, since it uses more digits than its factorization.
276256411201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 622 (or 311 counting only the distinct ones).
The product of its (nonzero) digits is 40320, while the sum is 37.
The spelling of 276256411201 in words is "two hundred seventy-six billion, two hundred fifty-six million, four hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •