Base | Representation |
---|---|
bin | 110100110010… |
… | …111110000101 |
3 | 222001011021021 |
4 | 310302332011 |
5 | 12020342021 |
6 | 1212351141 |
7 | 225432421 |
oct | 64627605 |
9 | 28034237 |
10 | 13840261 |
11 | 78a3436 |
12 | 47754b1 |
13 | 2b37806 |
14 | 1ba3b81 |
15 | 1335c41 |
hex | d32f85 |
13840261 has 8 divisors (see below), whose sum is σ = 14931864. Its totient is φ = 12779520.
The previous prime is 13840249. The next prime is 13840271. The reversal of 13840261 is 16204831.
13840261 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 4 ways, for example, as 7049025 + 6791236 = 2655^2 + 2606^2 .
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 13840261 - 213 = 13832069 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 (13840201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6780 + ... + 8581.
It is an arithmetic number, because the mean of its divisors is an integer number (1866483).
Almost surely, 213840261 is an apocalyptic number.
It is an amenable number.
13840261 is a deficient number, since it is larger than the sum of its proper divisors (1091603).
13840261 is a wasteful number, since it uses less digits than its factorization.
13840261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15431.
The product of its (nonzero) digits is 1152, while the sum is 25.
The square root of 13840261 is about 3720.2501259996. The cubic root of 13840261 is about 240.0940661360.
The spelling of 13840261 in words is "thirteen million, eight hundred forty thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •