Base | Representation |
---|---|
bin | 110011011100… |
… | …001001010100 |
3 | 221101002102200 |
4 | 303130021110 |
5 | 11423002003 |
6 | 1201004500 |
7 | 222421533 |
oct | 63341124 |
9 | 27332380 |
10 | 13484628 |
11 | 7680223 |
12 | 4623730 |
13 | 2a41991 |
14 | 1b1031a |
15 | 12b56a3 |
hex | cdc254 |
13484628 has 72 divisors (see below), whose sum is σ = 36132096. Its totient is φ = 4233600.
The previous prime is 13484617. The next prime is 13484641. The reversal of 13484628 is 82648431.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 13484592 and 13484601.
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 23 ways as a sum of consecutive naturals, for example, 47848 + ... + 48128.
Almost surely, 213484628 is an apocalyptic number.
13484628 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13484628, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (18066048).
13484628 is an abundant number, since it is smaller than the sum of its proper divisors (22647468).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13484628 is a wasteful number, since it uses less digits than its factorization.
13484628 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 365 (or 360 counting only the distinct ones).
The product of its digits is 36864, while the sum is 36.
The square root of 13484628 is about 3672.1421541111. The cubic root of 13484628 is about 238.0197474376.
The spelling of 13484628 in words is "thirteen million, four hundred eighty-four thousand, six hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •