Base | Representation |
---|---|
bin | 11111000000100… |
… | …10000011101000 |
3 | 200010110111200000 |
4 | 33200102003220 |
5 | 1013042331213 |
6 | 41451143000 |
7 | 6305663463 |
oct | 1740220350 |
9 | 603414600 |
10 | 260120808 |
11 | 123916682 |
12 | 73144a60 |
13 | 41b7724c |
14 | 267922da |
15 | 17c82c73 |
hex | f8120e8 |
260120808 has 144 divisors (see below), whose sum is σ = 777766080. Its totient is φ = 81430272.
The previous prime is 260120801. The next prime is 260120813. The reversal of 260120808 is 808021062.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (260120801) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 561585 + ... + 562047.
Almost surely, 2260120808 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 260120808, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (388883040).
260120808 is an abundant number, since it is smaller than the sum of its proper divisors (517645272).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
260120808 is a wasteful number, since it uses less digits than its factorization.
260120808 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 518 (or 485 counting only the distinct ones).
The product of its (nonzero) digits is 1536, while the sum is 27.
The square root of 260120808 is about 16128.2611585998. The cubic root of 260120808 is about 638.3492681151.
It can be divided in two parts, 2601 and 20808, that added together give a square (23409 = 1532).
The spelling of 260120808 in words is "two hundred sixty million, one hundred twenty thousand, eight hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •