Base | Representation |
---|---|
bin | 111100000110110101000010… |
… | …010100000000011111010101 |
3 | 1021122222210212012122010200111 |
4 | 330012311002110000133111 |
5 | 234122121001442031040 |
6 | 2334121353554443021 |
7 | 106452543230461414 |
oct | 7406650224003725 |
9 | 1248883765563614 |
10 | 264352054642645 |
11 | 7725a093224842 |
12 | 25795248293471 |
13 | b4673a40a1098 |
14 | 493c9c9d6d47b |
15 | 208660c208dea |
hex | f06d425007d5 |
264352054642645 has 12 divisors (see below), whose sum is σ = 325148309456580. Its totient is φ = 206323554836480.
The previous prime is 264352054642609. The next prime is 264352054642673. The reversal of 264352054642645 is 546246450253462.
It can be written as a sum of positive squares in 6 ways, for example, as 70326572576836 + 194025482065809 = 8386094^2 + 13929303^2 .
It is not a de Polignac number, because 264352054642645 - 27 = 264352054642517 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 264352054642645.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 15725872300 + ... + 15725889109.
It is an arithmetic number, because the mean of its divisors is an integer number (27095692454715).
Almost surely, 2264352054642645 is an apocalyptic number.
It is an amenable number.
264352054642645 is a deficient number, since it is larger than the sum of its proper divisors (60796254813935).
264352054642645 is an equidigital number, since it uses as much as digits as its factorization.
264352054642645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31451761496 (or 31451761455 counting only the distinct ones).
The product of its (nonzero) digits is 165888000, while the sum is 58.
The spelling of 264352054642645 in words is "two hundred sixty-four trillion, three hundred fifty-two billion, fifty-four million, six hundred forty-two thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •