Base | Representation |
---|---|
bin | 110110110011… |
… | …000100001101 |
3 | 1000000210222212 |
4 | 312303010031 |
5 | 12134134231 |
6 | 1231520205 |
7 | 233046203 |
oct | 66630415 |
9 | 30023885 |
10 | 14364941 |
11 | 8121658 |
12 | 4989065 |
13 | 2c8c586 |
14 | 1c9d073 |
15 | 13db42b |
hex | db310d |
14364941 has 8 divisors (see below), whose sum is σ = 14559000. Its totient is φ = 14172480.
The previous prime is 14364937. The next prime is 14364953. The reversal of 14364941 is 14946341.
It is a happy number.
14364941 is digitally balanced in base 2, 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 84100 + 14280841 = 290^2 + 3779^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 14364941 - 22 = 14364937 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14364898 and 14364907.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14364971) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 33911 + ... + 34331.
It is an arithmetic number, because the mean of its divisors is an integer number (1819875).
Almost surely, 214364941 is an apocalyptic number.
It is an amenable number.
14364941 is a deficient number, since it is larger than the sum of its proper divisors (194059).
14364941 is a wasteful number, since it uses less digits than its factorization.
14364941 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 799.
The product of its digits is 10368, while the sum is 32.
The square root of 14364941 is about 3790.1109482441. The cubic root of 14364941 is about 243.0904787063.
The spelling of 14364941 in words is "fourteen million, three hundred sixty-four thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •