Base | Representation |
---|---|
bin | 11111000000010… |
… | …00001111101101 |
3 | 200010101110112121 |
4 | 33200020033231 |
5 | 1013040034441 |
6 | 41450232541 |
7 | 6305435353 |
oct | 1740101755 |
9 | 603343477 |
10 | 260080621 |
11 | 123899469 |
12 | 73125751 |
13 | 41b61b78 |
14 | 267817d3 |
15 | 17c75dd1 |
hex | f8083ed |
260080621 has 4 divisors (see below), whose sum is σ = 260247744. Its totient is φ = 259913500.
The previous prime is 260080577. The next prime is 260080627. The reversal of 260080621 is 126080062.
260080621 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 260080621 - 211 = 260078573 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (260080627) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 81205 + ... + 84346.
It is an arithmetic number, because the mean of its divisors is an integer number (65061936).
Almost surely, 2260080621 is an apocalyptic number.
It is an amenable number.
260080621 is a deficient number, since it is larger than the sum of its proper divisors (167123).
260080621 is a wasteful number, since it uses less digits than its factorization.
260080621 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 167122.
The product of its (nonzero) digits is 1152, while the sum is 25.
The square root of 260080621 is about 16127.0152539148. The cubic root of 260080621 is about 638.3163927966.
It can be divided in two parts, 2600806 and 21, that multiplied together give a triangular number (54616926 = T10451).
The spelling of 260080621 in words is "two hundred sixty million, eighty thousand, six hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •