Base | Representation |
---|---|
bin | 110101111100… |
… | …010011111001 |
3 | 222121102100100 |
4 | 311330103321 |
5 | 12110000130 |
6 | 1223030013 |
7 | 231123300 |
oct | 65742371 |
9 | 28542310 |
10 | 14140665 |
11 | 7a89100 |
12 | 489b309 |
13 | 2c11476 |
14 | 1c41437 |
15 | 1394c60 |
hex | d7c4f9 |
14140665 has 108 divisors (see below), whose sum is σ = 31931172. Its totient is φ = 5765760.
The previous prime is 14140639. The next prime is 14140667. The reversal of 14140665 is 56604141.
14140665 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 2 ways, for example, as 7683984 + 6456681 = 2772^2 + 2541^2 .
It is not a de Polignac number, because 14140665 - 29 = 14140153 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14140667) by changing a digit.
It is a polite number, since it can be written in 107 ways as a sum of consecutive naturals, for example, 266779 + ... + 266831.
It is an arithmetic number, because the mean of its divisors is an integer number (295659).
Almost surely, 214140665 is an apocalyptic number.
14140665 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
14140665 is an abundant number, since it is smaller than the sum of its proper divisors (17790507).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
14140665 is a wasteful number, since it uses less digits than its factorization.
14140665 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100 (or 79 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 27.
The square root of 14140665 is about 3760.4075576990. The cubic root of 14140665 is about 241.8187347843.
The spelling of 14140665 in words is "fourteen million, one hundred forty thousand, six hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •