Base | Representation |
---|---|
bin | 11000111001010011… |
… | …00100001001000000 |
3 | 1021111110122210100000 |
4 | 30130221210021000 |
5 | 204333040403442 |
6 | 10050130200000 |
7 | 652132245600 |
oct | 143451441100 |
9 | 37443583300 |
10 | 13365559872 |
11 | 5739567a55 |
12 | 2710123000 |
13 | 1350045312 |
14 | 90b126c00 |
15 | 5335b0d4c |
hex | 31ca64240 |
13365559872 has 252 divisors, whose sum is σ = 46217829840. Its totient is φ = 3818513664.
The previous prime is 13365559849. The next prime is 13365559939. The reversal of 13365559872 is 27895556331.
13365559872 is a `hidden beast` number, since 1 + 3 + 3 + 6 + 5 + 559 + 87 + 2 = 666.
It is a tau number, because it is divible by the number of its divisors (252).
It is a Harshad number since it is a multiple of its sum of digits (54).
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 753279 + ... + 770817.
Almost surely, 213365559872 is an apocalyptic number.
13365559872 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13365559872, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23108914920).
13365559872 is an abundant number, since it is smaller than the sum of its proper divisors (32852269968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13365559872 is an equidigital number, since it uses as much as digits as its factorization.
13365559872 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17580 (or 17551 counting only the distinct ones).
The product of its digits is 6804000, while the sum is 54.
The spelling of 13365559872 in words is "thirteen billion, three hundred sixty-five million, five hundred fifty-nine thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •