Base | Representation |
---|---|
bin | 11111001001101… |
… | …01010010000101 |
3 | 200012201002222001 |
4 | 33210311102011 |
5 | 1013344014134 |
6 | 41532505301 |
7 | 6322062301 |
oct | 1744652205 |
9 | 605632861 |
10 | 261313669 |
11 | 124560911 |
12 | 7361b231 |
13 | 421a4196 |
14 | 269c2d01 |
15 | 17e1b414 |
hex | f935485 |
261313669 has 4 divisors (see below), whose sum is σ = 275067040. Its totient is φ = 247560300.
The previous prime is 261313643. The next prime is 261313697. The reversal of 261313669 is 966313162.
261313669 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 261313669 - 211 = 261311621 is a prime.
It is a super-2 number, since 2×2613136692 = 136569667212483122, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (261313609) 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, 6876657 + ... + 6876694.
It is an arithmetic number, because the mean of its divisors is an integer number (68766760).
Almost surely, 2261313669 is an apocalyptic number.
It is an amenable number.
261313669 is a deficient number, since it is larger than the sum of its proper divisors (13753371).
261313669 is a wasteful number, since it uses less digits than its factorization.
261313669 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13753370.
The product of its digits is 34992, while the sum is 37.
The square root of 261313669 is about 16165.1993182887. The cubic root of 261313669 is about 639.3235601999.
The spelling of 261313669 in words is "two hundred sixty-one million, three hundred thirteen thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •