Base | Representation |
---|---|
bin | 111100000110100010011010… |
… | …110111101110011001100000 |
3 | 1021122220220021010122202001212 |
4 | 330012202122313232121200 |
5 | 234121304032241024011 |
6 | 2334104250255245252 |
7 | 106451235000223064 |
oct | 7406423267563140 |
9 | 1248826233582055 |
10 | 264332065564256 |
11 | 77251665985348 |
12 | 257913a9b19828 |
13 | b465539a4b651 |
14 | 493ba512cbaa4 |
15 | 2085d3c3e908b |
hex | f0689adee660 |
264332065564256 has 12 divisors (see below), whose sum is σ = 520403754079692. Its totient is φ = 132166032782112.
The previous prime is 264332065564183. The next prime is 264332065564267. The reversal of 264332065564256 is 652465560233462.
264332065564256 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×2643320655642562 (a number of 30 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 264332065564195 and 264332065564204.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4130188524410 + ... + 4130188524473.
It is an arithmetic number, because the mean of its divisors is an integer number (43366979506641).
Almost surely, 2264332065564256 is an apocalyptic number.
It is an amenable number.
264332065564256 is a deficient number, since it is larger than the sum of its proper divisors (256071688515436).
264332065564256 is an equidigital number, since it uses as much as digits as its factorization.
264332065564256 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8260377048893 (or 8260377048885 counting only the distinct ones).
The product of its (nonzero) digits is 186624000, while the sum is 59.
The spelling of 264332065564256 in words is "two hundred sixty-four trillion, three hundred thirty-two billion, sixty-five million, five hundred sixty-four thousand, two hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •