Base | Representation |
---|---|
bin | 11111000000110… |
… | …10011101011111 |
3 | 200010112020212221 |
4 | 33200122131133 |
5 | 1013044431411 |
6 | 41452010211 |
7 | 6306166030 |
oct | 1740323537 |
9 | 603466787 |
10 | 260155231 |
11 | 12393a526 |
12 | 73160967 |
13 | 41b89b0b |
14 | 267a0a87 |
15 | 17c8d071 |
hex | f81a75f |
260155231 has 8 divisors (see below), whose sum is σ = 310247424. Its totient is φ = 213294840.
The previous prime is 260155229. The next prime is 260155241. The reversal of 260155231 is 132551062.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 260155231 - 21 = 260155229 is a prime.
It is a super-2 number, since 2×2601552312 = 135361488433326722, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 260155196 and 260155205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (260155211) 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 7 ways as a sum of consecutive naturals, for example, 807775 + ... + 808096.
It is an arithmetic number, because the mean of its divisors is an integer number (38780928).
Almost surely, 2260155231 is an apocalyptic number.
260155231 is a deficient number, since it is larger than the sum of its proper divisors (50092193).
260155231 is a wasteful number, since it uses less digits than its factorization.
260155231 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1615901.
The product of its (nonzero) digits is 1800, while the sum is 25.
The square root of 260155231 is about 16129.3282873156. The cubic root of 260155231 is about 638.3774254519.
The spelling of 260155231 in words is "two hundred sixty million, one hundred fifty-five thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •