Base | Representation |
---|---|
bin | 1000011010000001… |
… | …1001100100000101 |
3 | 12211021021012110221 |
4 | 2012200121210011 |
5 | 14110144442021 |
6 | 1011531344341 |
7 | 106631061061 |
oct | 20640314405 |
9 | 5737235427 |
10 | 2256640261 |
11 | a588a6257 |
12 | 52b8b20b1 |
13 | 29c6a32c5 |
14 | 1759c2aa1 |
15 | d31a9241 |
hex | 86819905 |
2256640261 has 2 divisors, whose sum is σ = 2256640262. Its totient is φ = 2256640260.
The previous prime is 2256640259. The next prime is 2256640289. The reversal of 2256640261 is 1620466522.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2144153025 + 112487236 = 46305^2 + 10606^2 .
It is a cyclic number.
It is not a de Polignac number, because 2256640261 - 21 = 2256640259 is a prime.
It is a super-2 number, since 2×22566402612 = 10184850535132296242, which contains 22 as substring.
Together with 2256640259, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2256640961) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1128320130 + 1128320131.
It is an arithmetic number, because the mean of its divisors is an integer number (1128320131).
Almost surely, 22256640261 is an apocalyptic number.
It is an amenable number.
2256640261 is a deficient number, since it is larger than the sum of its proper divisors (1).
2256640261 is an equidigital number, since it uses as much as digits as its factorization.
2256640261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34560, while the sum is 34.
The square root of 2256640261 is about 47504.1078329022. The cubic root of 2256640261 is about 1311.6584982452.
The spelling of 2256640261 in words is "two billion, two hundred fifty-six million, six hundred forty thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •