Base | Representation |
---|---|
bin | 110011111001… |
… | …100111010000 |
3 | 221121020000001 |
4 | 303321213100 |
5 | 11440332303 |
6 | 1203335344 |
7 | 223433452 |
oct | 63714720 |
9 | 27536001 |
10 | 13605328 |
11 | 7752980 |
12 | 4681554 |
13 | 2a848b9 |
14 | 1b422d2 |
15 | 12db31d |
hex | cf99d0 |
13605328 has 40 divisors (see below), whose sum is σ = 30015936. Its totient is φ = 5913600.
The previous prime is 13605299. The next prime is 13605331. The reversal of 13605328 is 82350631.
It is a Smith number, since the sum of its digits (28) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 13605296 and 13605305.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2368 + ... + 5728.
Almost surely, 213605328 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 13605328, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15007968).
13605328 is an abundant number, since it is smaller than the sum of its proper divisors (16410608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13605328 is a wasteful number, since it uses less digits than its factorization.
13605328 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3403 (or 3397 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 28.
The square root of 13605328 is about 3688.5400906050. The cubic root of 13605328 is about 238.7278052886.
Adding to 13605328 its reverse (82350631), we get a palindrome (95955959).
The spelling of 13605328 in words is "thirteen million, six hundred five thousand, three hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •