Base | Representation |
---|---|
bin | 111100001000000111111111… |
… | …101011111011001101001110 |
3 | 1021200022022210002210200002020 |
4 | 330020013333223323031032 |
5 | 234130100414033332311 |
6 | 2334230324545311010 |
7 | 106462145514352131 |
oct | 7410077753731516 |
9 | 1250268702720066 |
10 | 264441131152206 |
11 | 77293943629898 |
12 | 257aa567935466 |
13 | b4728cb7938c8 |
14 | 494303a358218 |
15 | 2088ac2468c06 |
hex | f081ffafb34e |
264441131152206 has 64 divisors (see below), whose sum is σ = 548308363401216. Its totient is φ = 84934128844800.
The previous prime is 264441131152157. The next prime is 264441131152229. The reversal of 264441131152206 is 602251131144462.
It is a super-2 number, since 2×2644411311522062 (a number of 30 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 246321166 + ... + 247392398.
It is an arithmetic number, because the mean of its divisors is an integer number (8567318178144).
Almost surely, 2264441131152206 is an apocalyptic number.
264441131152206 is an abundant number, since it is smaller than the sum of its proper divisors (283867232249010).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
264441131152206 is a wasteful number, since it uses less digits than its factorization.
264441131152206 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1077017.
The product of its (nonzero) digits is 276480, while the sum is 42.
Adding to 264441131152206 its reverse (602251131144462), we get a palindrome (866692262296668).
The spelling of 264441131152206 in words is "two hundred sixty-four trillion, four hundred forty-one billion, one hundred thirty-one million, one hundred fifty-two thousand, two hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •