Base | Representation |
---|---|
bin | 110101001110… |
… | …111101111101 |
3 | 222020222120200 |
4 | 311032331331 |
5 | 12033024231 |
6 | 1215034113 |
7 | 226420650 |
oct | 65167575 |
9 | 28228520 |
10 | 13954941 |
11 | 7971610 |
12 | 480b939 |
13 | 2b77a80 |
14 | 1bd3897 |
15 | 1359be6 |
hex | d4ef7d |
13954941 has 48 divisors (see below), whose sum is σ = 27081600. Its totient is φ = 6687360.
The previous prime is 13954939. The next prime is 13954973. The reversal of 13954941 is 14945931.
It is a happy number.
It is not a de Polignac number, because 13954941 - 21 = 13954939 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 13954896 and 13954905.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13954921) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 8235 + ... + 9783.
It is an arithmetic number, because the mean of its divisors is an integer number (564200).
Almost surely, 213954941 is an apocalyptic number.
13954941 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
13954941 is a deficient number, since it is larger than the sum of its proper divisors (13126659).
13954941 is a wasteful number, since it uses less digits than its factorization.
13954941 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1586 (or 1583 counting only the distinct ones).
The product of its digits is 19440, while the sum is 36.
The square root of 13954941 is about 3735.6312719539. The cubic root of 13954941 is about 240.7553804241.
It can be divided in two parts, 1395 and 4941, that added together give a palindrome (6336).
The spelling of 13954941 in words is "thirteen million, nine hundred fifty-four thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •