Base | Representation |
---|---|
bin | 1001101100010001100010… |
… | …0101100001100010011101 |
3 | 1101201201120201212220011201 |
4 | 2123010120211201202131 |
5 | 2344042422421220021 |
6 | 34355223001115501 |
7 | 2146613136321541 |
oct | 233043045414235 |
9 | 41651521786151 |
10 | 10656226351261 |
11 | 3439309a71507 |
12 | 12412b8788b91 |
13 | 5c3b547a3a5a |
14 | 28ba9a9d3a21 |
15 | 1372d60a0591 |
hex | 9b11896189d |
10656226351261 has 2 divisors, whose sum is σ = 10656226351262. Its totient is φ = 10656226351260.
The previous prime is 10656226351241. The next prime is 10656226351271. The reversal of 10656226351261 is 16215362265601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6700881023236 + 3955345328025 = 2588606^2 + 1988805^2 .
It is a cyclic number.
It is not a de Polignac number, because 10656226351261 - 25 = 10656226351229 is a prime.
It is a super-2 number, since 2×106562263512612 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10656226351241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5328113175630 + 5328113175631.
It is an arithmetic number, because the mean of its divisors is an integer number (5328113175631).
Almost surely, 210656226351261 is an apocalyptic number.
It is an amenable number.
10656226351261 is a deficient number, since it is larger than the sum of its proper divisors (1).
10656226351261 is an equidigital number, since it uses as much as digits as its factorization.
10656226351261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 777600, while the sum is 46.
The spelling of 10656226351261 in words is "ten trillion, six hundred fifty-six billion, two hundred twenty-six million, three hundred fifty-one thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •