Base | Representation |
---|---|
bin | 110101001111… |
… | …011000010000 |
3 | 222021001220000 |
4 | 311033120100 |
5 | 12033102444 |
6 | 1215050000 |
7 | 226425603 |
oct | 65173020 |
9 | 28231800 |
10 | 13956624 |
11 | 7972900 |
12 | 4810900 |
13 | 2b78776 |
14 | 1bd433a |
15 | 135a469 |
hex | d4f610 |
13956624 has 150 divisors (see below), whose sum is σ = 44899470. Its totient is φ = 4181760.
The previous prime is 13956611. The next prime is 13956629. The reversal of 13956624 is 42665931.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 10036224 + 3920400 = 3168^2 + 1980^2 .
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (13956629) 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 29 ways as a sum of consecutive naturals, for example, 156772 + ... + 156860.
Almost surely, 213956624 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13956624, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22449735).
13956624 is an abundant number, since it is smaller than the sum of its proper divisors (30942846).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13956624 is a wasteful number, since it uses less digits than its factorization.
13956624 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131 (or 105 counting only the distinct ones).
The product of its digits is 38880, while the sum is 36.
The square root of 13956624 is about 3735.8565282944. The cubic root of 13956624 is about 240.7650585975.
The spelling of 13956624 in words is "thirteen million, nine hundred fifty-six thousand, six hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •