Base | Representation |
---|---|
bin | 11111011111101… |
… | …01011101000000 |
3 | 200102010122110100 |
4 | 33233311131000 |
5 | 1020113313302 |
6 | 42114402400 |
7 | 6355434264 |
oct | 1757653500 |
9 | 612118410 |
10 | 264197952 |
11 | 126150917 |
12 | 74590400 |
13 | 42973c65 |
14 | 271340a4 |
15 | 182dad1c |
hex | fbf5740 |
264197952 has 84 divisors (see below), whose sum is σ = 801851076. Its totient is φ = 82882560.
The previous prime is 264197939. The next prime is 264198017. The reversal of 264197952 is 259791462.
It can be written as a sum of positive squares in 2 ways, for example, as 112021056 + 152176896 = 10584^2 + 12336^2 .
It is a junction number, because it is equal to n+sod(n) for n = 264197898 and 264197907.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3699 + ... + 23282.
Almost surely, 2264197952 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 264197952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (400925538).
264197952 is an abundant number, since it is smaller than the sum of its proper divisors (537653124).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
264197952 is a wasteful number, since it uses less digits than its factorization.
264197952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27016 (or 27003 counting only the distinct ones).
The product of its digits is 272160, while the sum is 45.
The square root of 264197952 is about 16254.1672195164. The cubic root of 264197952 is about 641.6671637784.
The spelling of 264197952 in words is "two hundred sixty-four million, one hundred ninety-seven thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •