Base | Representation |
---|---|
bin | 110101100110… |
… | …010000100101 |
3 | 222102211110000 |
4 | 311212100211 |
5 | 12044102331 |
6 | 1221051513 |
7 | 230266044 |
oct | 65462045 |
9 | 28384400 |
10 | 14050341 |
11 | 7a27258 |
12 | 4856b99 |
13 | 2bac316 |
14 | 1c1a55b |
15 | 13780e6 |
hex | d66425 |
14050341 has 20 divisors (see below), whose sum is σ = 21235500. Its totient is φ = 9256896.
The previous prime is 14050339. The next prime is 14050349. The reversal of 14050341 is 14305041.
It is a happy number.
14050341 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 7001316 + 7049025 = 2646^2 + 2655^2 .
It is not a de Polignac number, because 14050341 - 21 = 14050339 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14050349) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 6235 + ... + 8183.
It is an arithmetic number, because the mean of its divisors is an integer number (1061775).
Almost surely, 214050341 is an apocalyptic number.
It is an amenable number.
14050341 is a deficient number, since it is larger than the sum of its proper divisors (7185159).
14050341 is an equidigital number, since it uses as much as digits as its factorization.
14050341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2050 (or 2041 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 18.
The square root of 14050341 is about 3748.3784494098. The cubic root of 14050341 is about 241.3027593633.
Adding to 14050341 its reverse (14305041), we get a palindrome (28355382).
The spelling of 14050341 in words is "fourteen million, fifty thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.068 sec. • engine limits •