Base | Representation |
---|---|
bin | 110111110100… |
… | …000011100101 |
3 | 1000112100011010 |
4 | 313310003211 |
5 | 12221144031 |
6 | 1241332433 |
7 | 235235250 |
oct | 67640345 |
9 | 30470133 |
10 | 14631141 |
11 | 8293658 |
12 | 4a97119 |
13 | 30537a5 |
14 | 1d2c097 |
15 | 1440246 |
hex | df40e5 |
14631141 has 8 divisors (see below), whose sum is σ = 22295104. Its totient is φ = 8360640.
The previous prime is 14631139. The next prime is 14631161. The reversal of 14631141 is 14113641.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 14631141 - 21 = 14631139 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21), and also a Moran number because the ratio is a prime number: 696721 = 14631141 / (1 + 4 + 6 + 3 + 1 + 1 + 4 + 1).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14631131) 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, 348340 + ... + 348381.
It is an arithmetic number, because the mean of its divisors is an integer number (2786888).
Almost surely, 214631141 is an apocalyptic number.
It is an amenable number.
14631141 is a deficient number, since it is larger than the sum of its proper divisors (7663963).
14631141 is an equidigital number, since it uses as much as digits as its factorization.
14631141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 696731.
The product of its digits is 288, while the sum is 21.
The square root of 14631141 is about 3825.0674503857. The cubic root of 14631141 is about 244.5828859878.
Adding to 14631141 its reverse (14113641), we get a palindrome (28744782).
The spelling of 14631141 in words is "fourteen million, six hundred thirty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •