Base | Representation |
---|---|
bin | 1100010001111011110011… |
… | …1010000000110011000000 |
3 | 1202210210200010101002122122 |
4 | 3010132330322000303000 |
5 | 3232210102343114202 |
6 | 44414503154023412 |
7 | 2562335244251453 |
oct | 304367472006300 |
9 | 52723603332578 |
10 | 13502251535552 |
11 | 43362aaa9717a |
12 | 16209b0877b68 |
13 | 76c34540cb40 |
14 | 34972629d49a |
15 | 186357cb69a2 |
hex | c47bce80cc0 |
13502251535552 has 224 divisors, whose sum is σ = 29945902812672. Its totient is φ = 6000555810816.
The previous prime is 13502251535489. The next prime is 13502251535561. The reversal of 13502251535552 is 25553515220531.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1446097028 + ... + 1446106364.
It is an arithmetic number, because the mean of its divisors is an integer number (133687066128).
Almost surely, 213502251535552 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 13502251535552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (14972951406336).
13502251535552 is an abundant number, since it is smaller than the sum of its proper divisors (16443651277120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13502251535552 is a wasteful number, since it uses less digits than its factorization.
13502251535552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9975 (or 9965 counting only the distinct ones).
The product of its (nonzero) digits is 1125000, while the sum is 44.
The spelling of 13502251535552 in words is "thirteen trillion, five hundred two billion, two hundred fifty-one million, five hundred thirty-five thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •