Base | Representation |
---|---|
bin | 11111100000110… |
… | …10011011111111 |
3 | 200102102100020222 |
4 | 33300122123333 |
5 | 1020133140224 |
6 | 42121531555 |
7 | 6356635034 |
oct | 1760323377 |
9 | 612370228 |
10 | 264349439 |
11 | 126244712 |
12 | 74643bbb |
13 | 429c7bb3 |
14 | 2717338b |
15 | 1831ab5e |
hex | fc1a6ff |
264349439 has 8 divisors (see below), whose sum is σ = 283273200. Its totient is φ = 245800576.
The previous prime is 264349433. The next prime is 264349447. The reversal of 264349439 is 934943462.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-264349439 is a prime.
It is a super-2 number, since 2×2643494392 = 139761251799229442, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 264349439.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (264349433) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 92264 + ... + 95085.
It is an arithmetic number, because the mean of its divisors is an integer number (35409150).
Almost surely, 2264349439 is an apocalyptic number.
264349439 is a deficient number, since it is larger than the sum of its proper divisors (18923761).
264349439 is a wasteful number, since it uses less digits than its factorization.
264349439 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 187449.
The product of its digits is 559872, while the sum is 44.
The square root of 264349439 is about 16258.8264951687. The cubic root of 264349439 is about 641.7897810058.
The spelling of 264349439 in words is "two hundred sixty-four million, three hundred forty-nine thousand, four hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •