Base | Representation |
---|---|
bin | 11001011010001100… |
… | …01100101101011100 |
3 | 1022012200220002010111 |
4 | 30231012030231130 |
5 | 210414211022112 |
6 | 10133344415404 |
7 | 662022564331 |
oct | 145506145534 |
9 | 38180802114 |
10 | 13641501532 |
11 | 58702aa00a |
12 | 2788617564 |
13 | 139526b6c9 |
14 | 935a36988 |
15 | 54c91b5a7 |
hex | 32d18cb5c |
13641501532 has 24 divisors (see below), whose sum is σ = 24209803296. Its totient is φ = 6724493568.
The previous prime is 13641501527. The next prime is 13641501551. The reversal of 13641501532 is 23510514631.
13641501532 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 13641501494 and 13641501503.
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 7 ways as a sum of consecutive naturals, for example, 802473 + ... + 819295.
It is an arithmetic number, because the mean of its divisors is an integer number (1008741804).
Almost surely, 213641501532 is an apocalyptic number.
It is an amenable number.
13641501532 is a deficient number, since it is larger than the sum of its proper divisors (10568301764).
13641501532 is a wasteful number, since it uses less digits than its factorization.
13641501532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19677 (or 19675 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 31.
The spelling of 13641501532 in words is "thirteen billion, six hundred forty-one million, five hundred one thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •