Base | Representation |
---|---|
bin | 110011111010… |
… | …010001000000 |
3 | 221121100200000 |
4 | 303322101000 |
5 | 11440424000 |
6 | 1203400000 |
7 | 223444320 |
oct | 63722100 |
9 | 27540600 |
10 | 13608000 |
11 | 775498a |
12 | 4683000 |
13 | 2a85b93 |
14 | 1b43280 |
15 | 12dc000 |
hex | cfa440 |
13608000 has 336 divisors, whose sum is σ = 57692544. Its totient is φ = 3110400.
The previous prime is 13607981. The next prime is 13608013. The reversal of 13608000 is 80631.
It is a tau number, because it is divible by the number of its divisors (336).
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1943997 + ... + 1944003.
It is an arithmetic number, because the mean of its divisors is an integer number (171704).
Almost surely, 213608000 is an apocalyptic number.
13608000 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 13608000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28846272).
13608000 is an abundant number, since it is smaller than the sum of its proper divisors (44084544).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13608000 is an frugal number, since it uses more digits than its factorization.
13608000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49 (or 17 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 18.
The square root of 13608000 is about 3688.9022757455. The cubic root of 13608000 is about 238.7434324738.
Adding to 13608000 its reverse (80631), we get a palindrome (13688631).
The spelling of 13608000 in words is "thirteen million, six hundred eight thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •