Base | Representation |
---|---|
bin | 11111001011110… |
… | …11111000101000 |
3 | 200020020210122200 |
4 | 33211323320220 |
5 | 1013432242411 |
6 | 41543020200 |
7 | 6324405354 |
oct | 1745737050 |
9 | 606223580 |
10 | 261602856 |
11 | 124739109 |
12 | 7373a660 |
13 | 422759b8 |
14 | 26a5a464 |
15 | 17e76e56 |
hex | f97be28 |
261602856 has 24 divisors (see below), whose sum is σ = 708507930. Its totient is φ = 87200928.
The previous prime is 261602843. The next prime is 261602857. The reversal of 261602856 is 658206162.
It can be written as a sum of positive squares in only one way, i.e., 261468900 + 133956 = 16170^2 + 366^2 .
It is a tau number, because it is divible by the number of its divisors (24).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a self number, because there is not a number n which added to its sum of digits gives 261602856.
It is not an unprimeable number, because it can be changed into a prime (261602857) 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 5 ways as a sum of consecutive naturals, for example, 1816615 + ... + 1816758.
Almost surely, 2261602856 is an apocalyptic number.
It is an amenable number.
261602856 is an abundant number, since it is smaller than the sum of its proper divisors (446905074).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
261602856 is a wasteful number, since it uses less digits than its factorization.
261602856 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3633385 (or 3633378 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 36.
The square root of 261602856 is about 16174.1415846406. The cubic root of 261602856 is about 639.5593125090.
The spelling of 261602856 in words is "two hundred sixty-one million, six hundred two thousand, eight hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •