Base | Representation |
---|---|
bin | 11000101100110011… |
… | …01000011110000000 |
3 | 1021020011101101001210 |
4 | 30112121220132000 |
5 | 204124221020000 |
6 | 10031503130120 |
7 | 646420155153 |
oct | 142631503600 |
9 | 37204341053 |
10 | 13260720000 |
11 | 5695370230 |
12 | 26a0ba3940 |
13 | 13343c88a8 |
14 | 8db235c9a |
15 | 5292a2350 |
hex | 316668780 |
13260720000 has 320 divisors, whose sum is σ = 48026626560. Its totient is φ = 3214080000.
The previous prime is 13260719999. The next prime is 13260720007. The reversal of 13260720000 is 2706231.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (320).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13260720007) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 2637489 + ... + 2642511.
It is an arithmetic number, because the mean of its divisors is an integer number (150083208).
Almost surely, 213260720000 is an apocalyptic number.
13260720000 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 13260720000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (24013313280).
13260720000 is an abundant number, since it is smaller than the sum of its proper divisors (34765906560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13260720000 is an equidigital number, since it uses as much as digits as its factorization.
13260720000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5071 (or 5044 counting only the distinct ones).
The product of its (nonzero) digits is 504, while the sum is 21.
The spelling of 13260720000 in words is "thirteen billion, two hundred sixty million, seven hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •