Base | Representation |
---|---|
bin | 11001011100110100… |
… | …01101001011001100 |
3 | 1022021020022220122010 |
4 | 30232122031023030 |
5 | 210440330223112 |
6 | 10135452421220 |
7 | 662411014401 |
oct | 145632151314 |
9 | 38236286563 |
10 | 13663523532 |
11 | 588178050a |
12 | 2793a77810 |
13 | 13999ac289 |
14 | 93892a2a8 |
15 | 54e81b63c |
hex | 32e68d2cc |
13663523532 has 48 divisors (see below), whose sum is σ = 32026628480. Its totient is φ = 4533833088.
The previous prime is 13663523527. The next prime is 13663523537. The reversal of 13663523532 is 23532536631.
It is a happy number.
13663523532 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (13663523527) and next prime (13663523537).
It is not an unprimeable number, because it can be changed into a prime (13663523537) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 2564223 + ... + 2569545.
Almost surely, 213663523532 is an apocalyptic number.
13663523532 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13663523532 is an abundant number, since it is smaller than the sum of its proper divisors (18363104948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13663523532 is a wasteful number, since it uses less digits than its factorization.
13663523532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6262 (or 6260 counting only the distinct ones).
The product of its digits is 291600, while the sum is 39.
The spelling of 13663523532 in words is "thirteen billion, six hundred sixty-three million, five hundred twenty-three thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •