Base | Representation |
---|---|
bin | 11111000100110… |
… | …11100110101000 |
3 | 200011112010111101 |
4 | 33202123212220 |
5 | 1013213343300 |
6 | 41511211144 |
7 | 6313531150 |
oct | 1742334650 |
9 | 604463441 |
10 | 260684200 |
11 | 124170997 |
12 | 73376ab4 |
13 | 4201380a |
14 | 2689b760 |
15 | 17d44b6a |
hex | f89b9a8 |
260684200 has 96 divisors (see below), whose sum is σ = 701740800. Its totient is φ = 88208640.
The previous prime is 260684197. The next prime is 260684209. The reversal of 260684200 is 2486062.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is not an unprimeable number, because it can be changed into a prime (260684209) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 109422 + ... + 111778.
It is an arithmetic number, because the mean of its divisors is an integer number (7309800).
Almost surely, 2260684200 is an apocalyptic number.
260684200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 260684200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (350870400).
260684200 is an abundant number, since it is smaller than the sum of its proper divisors (441056600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
260684200 is a wasteful number, since it uses less digits than its factorization.
260684200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2459 (or 2450 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 28.
The square root of 260684200 is about 16145.7176985106. The cubic root of 260684200 is about 638.8097996896.
The spelling of 260684200 in words is "two hundred sixty million, six hundred eighty-four thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •