Base | Representation |
---|---|
bin | 111100100000011101010110… |
… | …010001100100111100010101 |
3 | 1021220020012000020200120202221 |
4 | 330200131112101210330111 |
5 | 234340000042443004310 |
6 | 2341550435131302341 |
7 | 110024024204264524 |
oct | 7440352621447425 |
9 | 1256205006616687 |
10 | 266113326141205 |
11 | 77879034057044 |
12 | 25a1a6665aa9b1 |
13 | b5644c07ccb3a |
14 | 499dd4cd924bb |
15 | 20b7341bdaada |
hex | f20756464f15 |
266113326141205 has 16 divisors (see below), whose sum is σ = 333435284668800. Its totient is φ = 203503083144768.
The previous prime is 266113326141191. The next prime is 266113326141209. The reversal of 266113326141205 is 502141623311662.
It is a cyclic number.
It is not a de Polignac number, because 266113326141205 - 219 = 266113325616917 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (266113326141209) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 746764707 + ... + 747120976.
It is an arithmetic number, because the mean of its divisors is an integer number (20839705291800).
Almost surely, 2266113326141205 is an apocalyptic number.
It is an amenable number.
266113326141205 is a deficient number, since it is larger than the sum of its proper divisors (67321958527595).
266113326141205 is a wasteful number, since it uses less digits than its factorization.
266113326141205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1493887260.
The product of its (nonzero) digits is 311040, while the sum is 43.
Adding to 266113326141205 its reverse (502141623311662), we get a palindrome (768254949452867).
The spelling of 266113326141205 in words is "two hundred sixty-six trillion, one hundred thirteen billion, three hundred twenty-six million, one hundred forty-one thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •