Base | Representation |
---|---|
bin | 11000111111000010… |
… | …00110011011000000 |
3 | 1021121211012011122101 |
4 | 30133201012123000 |
5 | 204432400011030 |
6 | 10055005320144 |
7 | 653255223214 |
oct | 143741063300 |
9 | 37554164571 |
10 | 13413672640 |
11 | 5763739875 |
12 | 2724266054 |
13 | 1359cbc704 |
14 | 91368c944 |
15 | 5379167ca |
hex | 31f8466c0 |
13413672640 has 112 divisors (see below), whose sum is σ = 32457542400. Its totient is φ = 5279436800.
The previous prime is 13413672617. The next prime is 13413672659. The reversal of 13413672640 is 4627631431.
It is a super-3 number, since 3×134136726403 (a number of 31 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 13413672640.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5590161 + ... + 5592559.
Almost surely, 213413672640 is an apocalyptic number.
13413672640 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 13413672640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16228771200).
13413672640 is an abundant number, since it is smaller than the sum of its proper divisors (19043869760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13413672640 is a wasteful number, since it uses less digits than its factorization.
13413672640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2690 (or 2680 counting only the distinct ones).
The product of its (nonzero) digits is 72576, while the sum is 37.
The spelling of 13413672640 in words is "thirteen billion, four hundred thirteen million, six hundred seventy-two thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •