Base | Representation |
---|---|
bin | 11000011111100100… |
… | …00111001000110000 |
3 | 1020221102110210112112 |
4 | 30033302013020300 |
5 | 203412310242220 |
6 | 10012455344452 |
7 | 643601401520 |
oct | 141762071060 |
9 | 36842423475 |
10 | 13149696560 |
11 | 563872a720 |
12 | 266b982128 |
13 | 13173c5750 |
14 | 8ca5b5680 |
15 | 51e6715c5 |
hex | 30fc87230 |
13149696560 has 320 divisors, whose sum is σ = 42381287424. Its totient is φ = 3660595200.
The previous prime is 13149696559. The next prime is 13149696691. The reversal of 13149696560 is 6569694131.
It is a junction number, because it is equal to n+sod(n) for n = 13149696499 and 13149696508.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2479832 + ... + 2485128.
Almost surely, 213149696560 is an apocalyptic number.
13149696560 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 13149696560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21190643712).
13149696560 is an abundant number, since it is smaller than the sum of its proper divisors (29231590864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13149696560 is a wasteful number, since it uses less digits than its factorization.
13149696560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5372 (or 5366 counting only the distinct ones).
The product of its (nonzero) digits is 1049760, while the sum is 50.
The spelling of 13149696560 in words is "thirteen billion, one hundred forty-nine million, six hundred ninety-six thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •