Base | Representation |
---|---|
bin | 11000011010000001… |
… | …01011000100000000 |
3 | 1020211011221121200000 |
4 | 30031000223010000 |
5 | 203313403311310 |
6 | 10004114400000 |
7 | 642465132012 |
oct | 141500530400 |
9 | 36734847600 |
10 | 13103182080 |
11 | 561444a6aa |
12 | 2658290000 |
13 | 130a88a9a1 |
14 | 8c43481b2 |
15 | 51a5344c0 |
hex | 30d02b100 |
13103182080 has 432 divisors, whose sum is σ = 47587263360. Its totient is φ = 3451797504.
The previous prime is 13103182013. The next prime is 13103182093. The reversal of 13103182080 is 8028130131.
It is a tau number, because it is divible by the number of its divisors (432).
It is a hoax number, since the sum of its digits (27) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 32036916 + ... + 32037324.
Almost surely, 213103182080 is an apocalyptic number.
13103182080 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 13103182080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23793631680).
13103182080 is an abundant number, since it is smaller than the sum of its proper divisors (34484081280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13103182080 is an equidigital number, since it uses as much as digits as its factorization.
13103182080 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 548 (or 522 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 27.
The spelling of 13103182080 in words is "thirteen billion, one hundred three million, one hundred eighty-two thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •