Base | Representation |
---|---|
bin | 11001010111000010… |
… | …00110110110010100 |
3 | 1022010212000201012120 |
4 | 30223201012312110 |
5 | 210340420012410 |
6 | 10131000415540 |
7 | 661251412260 |
oct | 145341066624 |
9 | 38125021176 |
10 | 13615000980 |
11 | 5857349829 |
12 | 277b7775b0 |
13 | 138c9204c9 |
14 | 9322d90a0 |
15 | 54a434570 |
hex | 32b846d94 |
13615000980 has 192 divisors, whose sum is σ = 45170442240. Its totient is φ = 2998425600.
The previous prime is 13615000951. The next prime is 13615001039. The reversal of 13615000980 is 8900051631.
13615000980 = T1 + T2 + ... + T4338.
13615000980 is a nontrivial binomial coefficient, being equal to C(4340, 3).
It is a congruent number.
It is an unprimeable number.
It is the 4338-th tetrahedral number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 3135651 + ... + 3139989.
It is an arithmetic number, because the mean of its divisors is an integer number (235262720).
Almost surely, 213615000980 is an apocalyptic number.
13615000980 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 13615000980, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22585221120).
13615000980 is an abundant number, since it is smaller than the sum of its proper divisors (31555441260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13615000980 is a wasteful number, since it uses less digits than its factorization.
13615000980 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4630 (or 4628 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 33.
The spelling of 13615000980 in words is "thirteen billion, six hundred fifteen million, nine hundred eighty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •