Base | Representation |
---|---|
bin | 110111110101… |
… | …010000001001 |
3 | 1000112120212121 |
4 | 313311100021 |
5 | 12221323131 |
6 | 1241411241 |
7 | 235255450 |
oct | 67652011 |
9 | 30476777 |
10 | 14636041 |
11 | 8297302 |
12 | 4a99b21 |
13 | 3055aa4 |
14 | 1d2db97 |
15 | 1441911 |
hex | df5409 |
14636041 has 4 divisors (see below), whose sum is σ = 16726912. Its totient is φ = 12545172.
The previous prime is 14636033. The next prime is 14636081. The reversal of 14636041 is 14063641.
14636041 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 14636041 - 23 = 14636033 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14635997 and 14636015.
It is not an unprimeable number, because it can be changed into a prime (14636081) 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, 1045425 + ... + 1045438.
It is an arithmetic number, because the mean of its divisors is an integer number (4181728).
Almost surely, 214636041 is an apocalyptic number.
It is an amenable number.
14636041 is a deficient number, since it is larger than the sum of its proper divisors (2090871).
14636041 is an equidigital number, since it uses as much as digits as its factorization.
14636041 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2090870.
The product of its (nonzero) digits is 1728, while the sum is 25.
The square root of 14636041 is about 3825.7079083485. The cubic root of 14636041 is about 244.6101867153.
Adding to 14636041 its reverse (14063641), we get a palindrome (28699682).
The spelling of 14636041 in words is "fourteen million, six hundred thirty-six thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •