Base | Representation |
---|---|
bin | 11111001010100… |
… | …01000101110001 |
3 | 200012220220012120 |
4 | 33211101011301 |
5 | 1013411140234 |
6 | 41535144453 |
7 | 6323045334 |
oct | 1745210561 |
9 | 605826176 |
10 | 261427569 |
11 | 124629447 |
12 | 73675129 |
13 | 42213c90 |
14 | 26a1261b |
15 | 17e40049 |
hex | f951171 |
261427569 has 8 divisors (see below), whose sum is σ = 375383232. Its totient is φ = 160878480.
The previous prime is 261427567. The next prime is 261427589. The reversal of 261427569 is 965724162.
261427569 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 261427569 - 21 = 261427567 is a prime.
It is a super-2 number, since 2×2614275692 = 136688747666499522, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 261427569.
It is not an unprimeable number, because it can be changed into a prime (261427567) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3351597 + ... + 3351674.
It is an arithmetic number, because the mean of its divisors is an integer number (46922904).
Almost surely, 2261427569 is an apocalyptic number.
It is an amenable number.
261427569 is a deficient number, since it is larger than the sum of its proper divisors (113955663).
261427569 is a wasteful number, since it uses less digits than its factorization.
261427569 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6703287.
The product of its digits is 181440, while the sum is 42.
The square root of 261427569 is about 16168.7219346490. The cubic root of 261427569 is about 639.4164350150.
The spelling of 261427569 in words is "two hundred sixty-one million, four hundred twenty-seven thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •