Base | Representation |
---|---|
bin | 11111100000100… |
… | …01001011011001 |
3 | 200102100102020022 |
4 | 33300101023121 |
5 | 1020130432023 |
6 | 42121040225 |
7 | 6356416334 |
oct | 1760211331 |
9 | 612312208 |
10 | 264311513 |
11 | 126219174 |
12 | 74626075 |
13 | 429b385b |
14 | 2716361b |
15 | 1830e7c8 |
hex | fc112d9 |
264311513 has 4 divisors (see below), whose sum is σ = 264389940. Its totient is φ = 264233088.
The previous prime is 264311447. The next prime is 264311557. The reversal of 264311513 is 315113462.
264311513 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 7414729 + 256896784 = 2723^2 + 16028^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-264311513 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (264311573) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 33920 + ... + 40977.
It is an arithmetic number, because the mean of its divisors is an integer number (66097485).
Almost surely, 2264311513 is an apocalyptic number.
It is an amenable number.
264311513 is a deficient number, since it is larger than the sum of its proper divisors (78427).
264311513 is an equidigital number, since it uses as much as digits as its factorization.
264311513 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 78426.
The product of its digits is 2160, while the sum is 26.
The square root of 264311513 is about 16257.6601329958. The cubic root of 264311513 is about 641.7590871845.
Adding to 264311513 its reverse (315113462), we get a palindrome (579424975).
The spelling of 264311513 in words is "two hundred sixty-four million, three hundred eleven thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •