Base | Representation |
---|---|
bin | 111100100010001010111111… |
… | …011100001100111101001101 |
3 | 1021220122102212221122112210102 |
4 | 330202022333130030331031 |
5 | 234343412144442314323 |
6 | 2342120505202020445 |
7 | 110035362502150241 |
oct | 7442127734147515 |
9 | 1256572787575712 |
10 | 266231054651213 |
11 | 77913a577a3103 |
12 | 25a39441647725 |
13 | b572633214a92 |
14 | 49a591a76c421 |
15 | 20ba432552328 |
hex | f222bf70cf4d |
266231054651213 has 2 divisors, whose sum is σ = 266231054651214. Its totient is φ = 266231054651212.
The previous prime is 266231054651203. The next prime is 266231054651239. The reversal of 266231054651213 is 312156450132662.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 255110310341929 + 11120744309284 = 15972173^2 + 3334778^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-266231054651213 is a prime.
It is a super-2 number, since 2×2662310546512132 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (266231054651203) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 133115527325606 + 133115527325607.
It is an arithmetic number, because the mean of its divisors is an integer number (133115527325607).
Almost surely, 2266231054651213 is an apocalyptic number.
It is an amenable number.
266231054651213 is a deficient number, since it is larger than the sum of its proper divisors (1).
266231054651213 is an equidigital number, since it uses as much as digits as its factorization.
266231054651213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1555200, while the sum is 47.
The spelling of 266231054651213 in words is "two hundred sixty-six trillion, two hundred thirty-one billion, fifty-four million, six hundred fifty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •