Base | Representation |
---|---|
bin | 111100000110100010011010… |
… | …111000000001011111011111 |
3 | 1021122220220021010210201100102 |
4 | 330012202122320001133133 |
5 | 234121304032301024323 |
6 | 2334104250301051315 |
7 | 106451235001000100 |
oct | 7406423270013737 |
9 | 1248826233721312 |
10 | 264332065642463 |
11 | 77251665a29085 |
12 | 257913a9b56b3b |
13 | b465539a78120 |
14 | 493ba5130c3a7 |
15 | 2085d3c412328 |
hex | f0689ae017df |
264332065642463 has 24 divisors (see below), whose sum is σ = 331253942801040. Its totient is φ = 209070691764480.
The previous prime is 264332065642451. The next prime is 264332065642471. The reversal of 264332065642463 is 364246560233462.
It is not a de Polignac number, because 264332065642463 - 226 = 264331998533599 is a prime.
It is a super-2 number, since 2×2643320656424632 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 264332065642399 and 264332065642408.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (264332065642423) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 68723978 + ... + 72468263.
It is an arithmetic number, because the mean of its divisors is an integer number (13802247616710).
Almost surely, 2264332065642463 is an apocalyptic number.
264332065642463 is a deficient number, since it is larger than the sum of its proper divisors (66921877158577).
264332065642463 is a wasteful number, since it uses less digits than its factorization.
264332065642463 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 141195207 (or 141195200 counting only the distinct ones).
The product of its (nonzero) digits is 89579520, while the sum is 56.
The spelling of 264332065642463 in words is "two hundred sixty-four trillion, three hundred thirty-two billion, sixty-five million, six hundred forty-two thousand, four hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •