Base | Representation |
---|---|
bin | 11111000101000… |
… | …01001001000001 |
3 | 200011120021121102 |
4 | 33202201021001 |
5 | 1013220110011 |
6 | 41511504145 |
7 | 6313654241 |
oct | 1742411101 |
9 | 604507542 |
10 | 260706881 |
11 | 124186a36 |
12 | 73388055 |
13 | 42020c36 |
14 | 268a5b21 |
15 | 17d4b73b |
hex | f8a1241 |
260706881 has 4 divisors (see below), whose sum is σ = 260822100. Its totient is φ = 260591664.
The previous prime is 260706857. The next prime is 260706889. The reversal of 260706881 is 188607062.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 134908225 + 125798656 = 11615^2 + 11216^2 .
It is a cyclic number.
It is not a de Polignac number, because 260706881 - 226 = 193598017 is a prime.
It is a super-2 number, since 2×2607068812 = 135936155601496322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (260706889) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 54146 + ... + 58763.
It is an arithmetic number, because the mean of its divisors is an integer number (65205525).
Almost surely, 2260706881 is an apocalyptic number.
It is an amenable number.
260706881 is a deficient number, since it is larger than the sum of its proper divisors (115219).
260706881 is a wasteful number, since it uses less digits than its factorization.
260706881 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 115218.
The product of its (nonzero) digits is 32256, while the sum is 38.
The square root of 260706881 is about 16146.4200676187. The cubic root of 260706881 is about 638.8283258410.
The spelling of 260706881 in words is "two hundred sixty million, seven hundred six thousand, eight hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •