Base | Representation |
---|---|
bin | 110100100011… |
… | …011100000000 |
3 | 221220220222221 |
4 | 310203130000 |
5 | 12011323030 |
6 | 1211140424 |
7 | 225046063 |
oct | 64433400 |
9 | 27826887 |
10 | 13776640 |
11 | 785a659 |
12 | 4744714 |
13 | 2b14877 |
14 | 1b888da |
15 | 1321e7a |
hex | d23700 |
13776640 has 72 divisors (see below), whose sum is σ = 33848640. Its totient is φ = 5369856.
The previous prime is 13776611. The next prime is 13776649. The reversal of 13776640 is 4667731.
It is a junction number, because it is equal to n+sod(n) for n = 13776596 and 13776605.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13776649) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 60046 + ... + 60274.
It is an arithmetic number, because the mean of its divisors is an integer number (470120).
Almost surely, 213776640 is an apocalyptic number.
13776640 is a gapful number since it is divisible by the number (10) 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 13776640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16924320).
13776640 is an abundant number, since it is smaller than the sum of its proper divisors (20072000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13776640 is an equidigital number, since it uses as much as digits as its factorization.
13776640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 297 (or 283 counting only the distinct ones).
The product of its (nonzero) digits is 21168, while the sum is 34.
The square root of 13776640 is about 3711.6896421980. The cubic root of 13776640 is about 239.7256123430.
The spelling of 13776640 in words is "thirteen million, seven hundred seventy-six thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •