Base | Representation |
---|---|
bin | 11000111111000100… |
… | …00101100111101100 |
3 | 1021121211200022201210 |
4 | 30133202011213230 |
5 | 204432431302000 |
6 | 10055015034420 |
7 | 653260352004 |
oct | 143742054754 |
9 | 37554608653 |
10 | 13413931500 |
11 | 57638a6302 |
12 | 272436ba10 |
13 | 135a080498 |
14 | 913719004 |
15 | 537968350 |
hex | 31f8859ec |
13413931500 has 96 divisors (see below), whose sum is σ = 39140337600. Its totient is φ = 3569817600.
The previous prime is 13413931483. The next prime is 13413931507. The reversal of 13413931500 is 513931431.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is not an unprimeable number, because it can be changed into a prime (13413931507) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 754716 + ... + 772284.
It is an arithmetic number, because the mean of its divisors is an integer number (407711850).
Almost surely, 213413931500 is an apocalyptic number.
13413931500 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 13413931500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (19570168800).
13413931500 is an abundant number, since it is smaller than the sum of its proper divisors (25726406100).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13413931500 is a wasteful number, since it uses less digits than its factorization.
13413931500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18100 (or 18088 counting only the distinct ones).
The product of its (nonzero) digits is 4860, while the sum is 30.
The spelling of 13413931500 in words is "thirteen billion, four hundred thirteen million, nine hundred thirty-one thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •