Base | Representation |
---|---|
bin | 11111001000110… |
… | …11000010111000 |
3 | 200012111122112201 |
4 | 33210123002320 |
5 | 1013332044300 |
6 | 41530315544 |
7 | 6321134053 |
oct | 1744330270 |
9 | 605448481 |
10 | 261206200 |
11 | 1244980a2 |
12 | 73588bb4 |
13 | 421672a8 |
14 | 26995a9a |
15 | 17de966a |
hex | f91b0b8 |
261206200 has 96 divisors (see below), whose sum is σ = 625696560. Its totient is φ = 101376000.
The previous prime is 261206177. The next prime is 261206221. The reversal of 261206200 is 2602162.
261206200 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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, 1353304 + ... + 1353496.
Almost surely, 2261206200 is an apocalyptic number.
261206200 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 261206200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (312848280).
261206200 is an abundant number, since it is smaller than the sum of its proper divisors (364490360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
261206200 is a wasteful number, since it uses less digits than its factorization.
261206200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 377 (or 368 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 19.
The square root of 261206200 is about 16161.8748912371. The cubic root of 261206200 is about 639.2359045163.
Adding to 261206200 its reverse (2602162), we get a palindrome (263808362).
The spelling of 261206200 in words is "two hundred sixty-one million, two hundred six thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •