Base | Representation |
---|---|
bin | 11111001010110… |
… | …10000010001000 |
3 | 200012222202110021 |
4 | 33211122002020 |
5 | 1013413323300 |
6 | 41540030224 |
7 | 6323260204 |
oct | 1745320210 |
9 | 605882407 |
10 | 261464200 |
11 | 124653a18 |
12 | 73692374 |
13 | 4222785a |
14 | 26a21b04 |
15 | 17e4ad1a |
hex | f95a088 |
261464200 has 96 divisors (see below), whose sum is σ = 632939400. Its totient is φ = 100362240.
The previous prime is 261464129. The next prime is 261464213. The reversal of 261464200 is 2464162.
It can be written as a sum of positive squares in 12 ways, for example, as 39513796 + 221950404 = 6286^2 + 14898^2 .
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 658402 + ... + 658798.
Almost surely, 2261464200 is an apocalyptic number.
261464200 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 261464200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (316469700).
261464200 is an abundant number, since it is smaller than the sum of its proper divisors (371475200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
261464200 is a wasteful number, since it uses less digits than its factorization.
261464200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 539 (or 530 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 25.
The square root of 261464200 is about 16169.8546684873. The cubic root of 261464200 is about 639.4462984422.
The spelling of 261464200 in words is "two hundred sixty-one million, four hundred sixty-four thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •