Base | Representation |
---|---|
bin | 11000001110100100… |
… | …01011000100010000 |
3 | 1020120111011110111112 |
4 | 30013102023010100 |
5 | 203114304400240 |
6 | 5550403232452 |
7 | 640220402525 |
oct | 140722130420 |
9 | 36514143445 |
10 | 13007106320 |
11 | 557519954a |
12 | 2630078728 |
13 | 12c39bc420 |
14 | 8b569914c |
15 | 511da7665 |
hex | 30748b110 |
13007106320 has 80 divisors (see below), whose sum is σ = 32824565760. Its totient is φ = 4764759552.
The previous prime is 13007106293. The next prime is 13007106389. The reversal of 13007106320 is 2360170031.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (80).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 82841 + ... + 181319.
It is an arithmetic number, because the mean of its divisors is an integer number (410307072).
Almost surely, 213007106320 is an apocalyptic number.
13007106320 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 13007106320, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16412282880).
13007106320 is an abundant number, since it is smaller than the sum of its proper divisors (19817459440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13007106320 is a wasteful number, since it uses less digits than its factorization.
13007106320 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 98632 (or 98626 counting only the distinct ones).
The product of its (nonzero) digits is 756, while the sum is 23.
Adding to 13007106320 its reverse (2360170031), we get a palindrome (15367276351).
The spelling of 13007106320 in words is "thirteen billion, seven million, one hundred six thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •