Base | Representation |
---|---|
bin | 11000011000000101… |
… | …11100110010100000 |
3 | 1020210001111120102220 |
4 | 30030002330302200 |
5 | 203300233024020 |
6 | 10002335511040 |
7 | 642210452040 |
oct | 141402746240 |
9 | 36701446386 |
10 | 13087001760 |
11 | 56062a9138 |
12 | 2652988480 |
13 | 1307414031 |
14 | 8c2135720 |
15 | 518dda240 |
hex | 30c0bcca0 |
13087001760 has 384 divisors, whose sum is σ = 48137048064. Its totient is φ = 2927124480.
The previous prime is 13087001723. The next prime is 13087001783. The reversal of 13087001760 is 6710078031.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 46572820 + ... + 46573100.
It is an arithmetic number, because the mean of its divisors is an integer number (125356896).
Almost surely, 213087001760 is an apocalyptic number.
13087001760 is a gapful number since it is divisible by the number (10) 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 13087001760, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24068524032).
13087001760 is an abundant number, since it is smaller than the sum of its proper divisors (35050046304).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13087001760 is a wasteful number, since it uses less digits than its factorization.
13087001760 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 556 (or 548 counting only the distinct ones).
The product of its (nonzero) digits is 7056, while the sum is 33.
Adding to 13087001760 its reverse (6710078031), we get a palindrome (19797079791).
The spelling of 13087001760 in words is "thirteen billion, eighty-seven million, one thousand, seven hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •