Base | Representation |
---|---|
bin | 11000010000010001… |
… | …01110110001000000 |
3 | 1020121111002002011020 |
4 | 30020020232301000 |
5 | 203131440031240 |
6 | 5552033545440 |
7 | 640453100364 |
oct | 141010566100 |
9 | 36544062136 |
10 | 13021408320 |
11 | 5582277888 |
12 | 2634a15280 |
13 | 12c695914b |
14 | 8b753d2a4 |
15 | 5132800d0 |
hex | 30822ec40 |
13021408320 has 448 divisors, whose sum is σ = 45646848000. Its totient is φ = 3132186624.
The previous prime is 13021408313. The next prime is 13021408321. The reversal of 13021408320 is 2380412031.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is not an unprimeable number, because it can be changed into a prime (13021408321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 54482761 + ... + 54482999.
Almost surely, 213021408320 is an apocalyptic number.
13021408320 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 13021408320, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22823424000).
13021408320 is an abundant number, since it is smaller than the sum of its proper divisors (32625439680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13021408320 is a wasteful number, since it uses less digits than its factorization.
13021408320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 410 (or 400 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 24.
The spelling of 13021408320 in words is "thirteen billion, twenty-one million, four hundred eight thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •