Base | Representation |
---|---|
bin | 11111000011111… |
… | …01010001010000 |
3 | 200011021211001121 |
4 | 33201331101100 |
5 | 1013200404302 |
6 | 41504412024 |
7 | 6312503002 |
oct | 1741752120 |
9 | 604254047 |
10 | 260559952 |
11 | 124096604 |
12 | 73317014 |
13 | 41c9c0b3 |
14 | 26868372 |
15 | 17d1ce37 |
hex | f87d450 |
260559952 has 40 divisors (see below), whose sum is σ = 535894272. Its totient is φ = 122304000.
The previous prime is 260559947. The next prime is 260559953. The reversal of 260559952 is 259955062.
260559952 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 260559899 and 260559908.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (260559953) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 132577 + ... + 134527.
Almost surely, 2260559952 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 260559952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (267947136).
260559952 is an abundant number, since it is smaller than the sum of its proper divisors (275334320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
260559952 is a wasteful number, since it uses less digits than its factorization.
260559952 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2467 (or 2461 counting only the distinct ones).
The product of its (nonzero) digits is 243000, while the sum is 43.
The square root of 260559952 is about 16141.8695323683. The cubic root of 260559952 is about 638.7082931499.
The spelling of 260559952 in words is "two hundred sixty million, five hundred fifty-nine thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •