Base | Representation |
---|---|
bin | 11001010110000110… |
… | …01111010111100000 |
3 | 1022010022021221020202 |
4 | 30223003033113200 |
5 | 210331413442202 |
6 | 10130120524332 |
7 | 661125023042 |
oct | 145303172740 |
9 | 38108257222 |
10 | 13607171552 |
11 | 5852991427 |
12 | 27790206a8 |
13 | 138b10b900 |
14 | 93125ba92 |
15 | 5498d9802 |
hex | 32b0cf5e0 |
13607171552 has 144 divisors (see below), whose sum is σ = 31078494720. Its totient is φ = 5840879616.
The previous prime is 13607171531. The next prime is 13607171561. The reversal of 13607171552 is 25517170631.
13607171552 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8181473 + ... + 8183135.
It is an arithmetic number, because the mean of its divisors is an integer number (215822880).
Almost surely, 213607171552 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 13607171552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15539247360).
13607171552 is an abundant number, since it is smaller than the sum of its proper divisors (17471323168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13607171552 is a wasteful number, since it uses less digits than its factorization.
13607171552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1805 (or 1784 counting only the distinct ones).
The product of its (nonzero) digits is 44100, while the sum is 38.
The spelling of 13607171552 in words is "thirteen billion, six hundred seven million, one hundred seventy-one thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •