Base | Representation |
---|---|
bin | 111100100111110110100001… |
… | …110110111010100011000101 |
3 | 1021222000202102210222011112212 |
4 | 330213312201312322203011 |
5 | 234421311111443024112 |
6 | 2343020102545153205 |
7 | 110105521565015102 |
oct | 7447664166724305 |
9 | 1258022383864485 |
10 | 266621400361157 |
11 | 77a54556775496 |
12 | 25aa101b62b805 |
13 | b5a03a067924a |
14 | 49ba78a67daa9 |
15 | 20c567b5ca522 |
hex | f27da1dba8c5 |
266621400361157 has 2 divisors, whose sum is σ = 266621400361158. Its totient is φ = 266621400361156.
The previous prime is 266621400361051. The next prime is 266621400361181. The reversal of 266621400361157 is 751163004126662.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 214758444220321 + 51862956140836 = 14654639^2 + 7201594^2 .
It is a cyclic number.
It is not a de Polignac number, because 266621400361157 - 226 = 266621333252293 is a prime.
It is a super-2 number, since 2×2666214003611572 (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 (266621400361357) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 133310700180578 + 133310700180579.
It is an arithmetic number, because the mean of its divisors is an integer number (133310700180579).
Almost surely, 2266621400361157 is an apocalyptic number.
It is an amenable number.
266621400361157 is a deficient number, since it is larger than the sum of its proper divisors (1).
266621400361157 is an equidigital number, since it uses as much as digits as its factorization.
266621400361157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2177280, while the sum is 50.
The spelling of 266621400361157 in words is "two hundred sixty-six trillion, six hundred twenty-one billion, four hundred million, three hundred sixty-one thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •