Base | Representation |
---|---|
bin | 110100000010… |
… | …010110000000 |
3 | 221200001001111 |
4 | 310002112000 |
5 | 11443003323 |
6 | 1204213104 |
7 | 223642636 |
oct | 64022600 |
9 | 27601044 |
10 | 13641088 |
11 | 777782a |
12 | 469a194 |
13 | 2a97c66 |
14 | 1b51356 |
15 | 12e6c0d |
hex | d02580 |
13641088 has 64 divisors (see below), whose sum is σ = 29376000. Its totient is φ = 6289920.
The previous prime is 13641083. The next prime is 13641101. The reversal of 13641088 is 88014631.
It is a tau number, because it is divible by the number of its divisors (64).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13641083) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 172633 + ... + 172711.
It is an arithmetic number, because the mean of its divisors is an integer number (459000).
Almost surely, 213641088 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 13641088, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14688000).
13641088 is an abundant number, since it is smaller than the sum of its proper divisors (15734912).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13641088 is an equidigital number, since it uses as much as digits as its factorization.
13641088 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 183 (or 171 counting only the distinct ones).
The product of its (nonzero) digits is 4608, while the sum is 31.
The square root of 13641088 is about 3693.3843558449. The cubic root of 13641088 is about 238.9367782684.
The spelling of 13641088 in words is "thirteen million, six hundred forty-one thousand, eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •