Base | Representation |
---|---|
bin | 11001010110111010… |
… | …01111000000000000 |
3 | 1022010210010010122000 |
4 | 30223131033000000 |
5 | 210340140021132 |
6 | 10130522544000 |
7 | 661236653451 |
oct | 145335170000 |
9 | 38123103560 |
10 | 13613985792 |
11 | 5856816030 |
12 | 277b368000 |
13 | 138c6563c4 |
14 | 932113128 |
15 | 54a2d387c |
hex | 32b74f000 |
13613985792 has 624 divisors, whose sum is σ = 47935042560. Its totient is φ = 3782246400.
The previous prime is 13613985779. The next prime is 13613985797. The reversal of 13613985792 is 29758931631.
13613985792 is a `hidden beast` number, since 1 + 3 + 61 + 3 + 9 + 8 + 579 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (54).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13613985797) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 439160817 + ... + 439160847.
Almost surely, 213613985792 is an apocalyptic number.
13613985792 is a gapful number since it is divisible by the number (12) 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 13613985792, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23967521280).
13613985792 is an abundant number, since it is smaller than the sum of its proper divisors (34321056768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13613985792 is a wasteful number, since it uses less digits than its factorization.
13613985792 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 113 (or 66 counting only the distinct ones).
The product of its digits is 2449440, while the sum is 54.
The spelling of 13613985792 in words is "thirteen billion, six hundred thirteen million, nine hundred eighty-five thousand, seven hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •