Base | Representation |
---|---|
bin | 111100000111100101011101… |
… | …001111111011000011111111 |
3 | 1021200011210001120212002022210 |
4 | 330013211131033323003333 |
5 | 234123443441304223343 |
6 | 2334201313021311503 |
7 | 106456363514224500 |
oct | 7407453517730377 |
9 | 1250153046762283 |
10 | 264404046164223 |
11 | 7727a143073499 |
12 | 257a3338105593 |
13 | b46c26b60a034 |
14 | 494131cd8cba7 |
15 | 2087b51839333 |
hex | f0795d3fb0ff |
264404046164223 has 24 divisors (see below), whose sum is σ = 412811939660160. Its totient is φ = 150087443410800.
The previous prime is 264404046164189. The next prime is 264404046164233. The reversal of 264404046164223 is 322461640404462.
It is not a de Polignac number, because 264404046164223 - 220 = 264404045115647 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (264404046164233) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5955828733 + ... + 5955873126.
It is an arithmetic number, because the mean of its divisors is an integer number (17200497485840).
Almost surely, 2264404046164223 is an apocalyptic number.
264404046164223 is a deficient number, since it is larger than the sum of its proper divisors (148407893495937).
264404046164223 is a wasteful number, since it uses less digits than its factorization.
264404046164223 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11911702027 (or 11911702020 counting only the distinct ones).
The product of its (nonzero) digits is 5308416, while the sum is 48.
Adding to 264404046164223 its reverse (322461640404462), we get a palindrome (586865686568685).
The spelling of 264404046164223 in words is "two hundred sixty-four trillion, four hundred four billion, forty-six million, one hundred sixty-four thousand, two hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •