Base | Representation |
---|---|
bin | 111100011111011010000000… |
… | …101011110000000100001111 |
3 | 1021212222021101022221200121002 |
4 | 330133122000223300010033 |
5 | 234332304003414422201 |
6 | 2341453320412330515 |
7 | 110015554364401223 |
oct | 7437320053600417 |
9 | 1255867338850532 |
10 | 266041023201551 |
11 | 77850400a16364 |
12 | 25a08648473a3b |
13 | b55a73a221300 |
14 | 499a650584783 |
15 | 20b550e32776b |
hex | f1f680af010f |
266041023201551 has 12 divisors (see below), whose sum is σ = 288154809541872. Its totient is φ = 245512492707456.
The previous prime is 266041023201509. The next prime is 266041023201617. The reversal of 266041023201551 is 155102320140662.
It is not a de Polignac number, because 266041023201551 - 218 = 266041022939407 is a prime.
It is a super-2 number, since 2×2660410232015512 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (266041023201451) 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 11 ways as a sum of consecutive naturals, for example, 203951786 + ... + 205252071.
It is an arithmetic number, because the mean of its divisors is an integer number (24012900795156).
Almost surely, 2266041023201551 is an apocalyptic number.
266041023201551 is a deficient number, since it is larger than the sum of its proper divisors (22113786340321).
266041023201551 is a wasteful number, since it uses less digits than its factorization.
266041023201551 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 409207730 (or 409207717 counting only the distinct ones).
The product of its (nonzero) digits is 86400, while the sum is 38.
The spelling of 266041023201551 in words is "two hundred sixty-six trillion, forty-one billion, twenty-three million, two hundred one thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •