Base | Representation |
---|---|
bin | 11000010001100101… |
… | …11001110101000000 |
3 | 1020122020212202021000 |
4 | 30020302321311000 |
5 | 203142302314210 |
6 | 5553110532000 |
7 | 640646053635 |
oct | 141062716500 |
9 | 36566782230 |
10 | 13032463680 |
11 | 5588538945 |
12 | 2638667000 |
13 | 12c902a192 |
14 | 8b8bba18c |
15 | 514215ac0 |
hex | 308cb9d40 |
13032463680 has 224 divisors, whose sum is σ = 46246694400. Its totient is φ = 3454838784.
The previous prime is 13032463579. The next prime is 13032463699. The reversal of 13032463680 is 8636423031.
13032463680 is a `hidden beast` number, since 1 + 303 + 246 + 36 + 80 = 666.
It is a super-3 number, since 3×130324636803 (a number of 31 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1490361 + ... + 1499079.
Almost surely, 213032463680 is an apocalyptic number.
13032463680 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 13032463680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (23123347200).
13032463680 is an abundant number, since it is smaller than the sum of its proper divisors (33214230720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13032463680 is a wasteful number, since it uses less digits than its factorization.
13032463680 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8918 (or 8902 counting only the distinct ones).
The product of its (nonzero) digits is 62208, while the sum is 36.
The spelling of 13032463680 in words is "thirteen billion, thirty-two million, four hundred sixty-three thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •