Base | Representation |
---|---|
bin | 11111000011011… |
… | …11110110001100 |
3 | 200011012000122022 |
4 | 33201233312030 |
5 | 1013142124342 |
6 | 41503305312 |
7 | 6312153500 |
oct | 1741576614 |
9 | 604160568 |
10 | 260504972 |
11 | 124059272 |
12 | 732ab238 |
13 | 41c80070 |
14 | 26852300 |
15 | 17d0b9d2 |
hex | f86fd8c |
260504972 has 72 divisors (see below), whose sum is σ = 601277040. Its totient is φ = 97614720.
The previous prime is 260504971. The next prime is 260504977. The reversal of 260504972 is 279405062.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (260504971) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 45722 + ... + 51102.
It is an arithmetic number, because the mean of its divisors is an integer number (8351070).
Almost surely, 2260504972 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 260504972, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (300638520).
260504972 is an abundant number, since it is smaller than the sum of its proper divisors (340772068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
260504972 is a wasteful number, since it uses less digits than its factorization.
260504972 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5431 (or 5422 counting only the distinct ones).
The product of its (nonzero) digits is 30240, while the sum is 35.
The square root of 260504972 is about 16140.1664179772. The cubic root of 260504972 is about 638.6633659947.
The spelling of 260504972 in words is "two hundred sixty million, five hundred four thousand, nine hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •