Base | Representation |
---|---|
bin | 110011001001… |
… | …001011010100 |
3 | 221020010212001 |
4 | 303021023110 |
5 | 11413010212 |
6 | 1155205044 |
7 | 221646160 |
oct | 63111324 |
9 | 27203761 |
10 | 13406932 |
11 | 7627910 |
12 | 45a6784 |
13 | 2a154c6 |
14 | 1acdca0 |
15 | 129c657 |
hex | cc92d4 |
13406932 has 96 divisors (see below), whose sum is σ = 32256000. Its totient is φ = 4717440.
The previous prime is 13406929. The next prime is 13406941. The reversal of 13406932 is 23960431.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a self number, because there is not a number n which added to its sum of digits gives 13406932.
It is a congruent number.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 169669 + ... + 169747.
It is an arithmetic number, because the mean of its divisors is an integer number (336000).
Almost surely, 213406932 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 13406932, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16128000).
13406932 is an abundant number, since it is smaller than the sum of its proper divisors (18849068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13406932 is a wasteful number, since it uses less digits than its factorization.
13406932 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 149 (or 147 counting only the distinct ones).
The product of its (nonzero) digits is 3888, while the sum is 28.
The square root of 13406932 is about 3661.5477601692. The cubic root of 13406932 is about 237.5617243078.
The spelling of 13406932 in words is "thirteen million, four hundred six thousand, nine hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •