Base | Representation |
---|---|
bin | 11001010101110000… |
… | …11010001001110000 |
3 | 1022010002221200022111 |
4 | 30222320122021300 |
5 | 210330202112034 |
6 | 10125540015104 |
7 | 661061625634 |
oct | 145270321160 |
9 | 38102850274 |
10 | 13604332144 |
11 | 5851322107 |
12 | 2778091494 |
13 | 138a6563a0 |
14 | 930b1cdc4 |
15 | 549528364 |
hex | 32ae1a270 |
13604332144 has 160 divisors (see below), whose sum is σ = 31437987840. Its totient is φ = 5642956800.
The previous prime is 13604332141. The next prime is 13604332201. The reversal of 13604332144 is 44123340631.
It is a Harshad number since it is a multiple of its sum of digits (31).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13604332141) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8658879 + ... + 8660449.
It is an arithmetic number, because the mean of its divisors is an integer number (196487424).
Almost surely, 213604332144 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 13604332144, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15718993920).
13604332144 is an abundant number, since it is smaller than the sum of its proper divisors (17833655696).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13604332144 is a wasteful number, since it uses less digits than its factorization.
13604332144 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1719 (or 1713 counting only the distinct ones).
The product of its (nonzero) digits is 20736, while the sum is 31.
Adding to 13604332144 its reverse (44123340631), we get a palindrome (57727672775).
The spelling of 13604332144 in words is "thirteen billion, six hundred four million, three hundred thirty-two thousand, one hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •