Base | Representation |
---|---|
bin | 11001011111011000… |
… | …01100100110000000 |
3 | 1022022201202220002000 |
4 | 30233230030212000 |
5 | 211011331020320 |
6 | 10141541224000 |
7 | 663061503426 |
oct | 145754144600 |
9 | 38281686060 |
10 | 13685016960 |
11 | 589292087a |
12 | 279b102000 |
13 | 13a1296394 |
14 | 93b723116 |
15 | 551664c90 |
hex | 32fb0c980 |
13685016960 has 512 divisors, whose sum is σ = 50996736000. Its totient is φ = 3463741440.
The previous prime is 13685016911. The next prime is 13685017061. The reversal of 13685016960 is 6961058631.
13685016960 is a `hidden beast` number, since 136 + 8 + 501 + 6 + 9 + 6 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (45).
It is a congruent number.
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, 31604904 + ... + 31605336.
It is an arithmetic number, because the mean of its divisors is an integer number (99603000).
Almost surely, 213685016960 is an apocalyptic number.
13685016960 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 13685016960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25498368000).
13685016960 is an abundant number, since it is smaller than the sum of its proper divisors (37311719040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13685016960 is a wasteful number, since it uses less digits than its factorization.
13685016960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 551 (or 533 counting only the distinct ones).
The product of its (nonzero) digits is 233280, while the sum is 45.
The spelling of 13685016960 in words is "thirteen billion, six hundred eighty-five million, sixteen thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •