Base | Representation |
---|---|
bin | 11000100101101100… |
… | …10010111011000000 |
3 | 1021002000020122011122 |
4 | 30102312102323000 |
5 | 204013442000211 |
6 | 10021533531412 |
7 | 645064466030 |
oct | 142266227300 |
9 | 37060218148 |
10 | 13201125056 |
11 | 5664766709 |
12 | 2685043b68 |
13 | 1324c61102 |
14 | 8d33618c0 |
15 | 523e2e6db |
hex | 312d92ec0 |
13201125056 has 112 divisors (see below), whose sum is σ = 31792444416. Its totient is φ = 5309190144.
The previous prime is 13201125053. The next prime is 13201125079. The reversal of 13201125056 is 65052110231.
It is a tau number, because it is divible by the number of its divisors (112).
It is not an unprimeable number, because it can be changed into a prime (13201125053) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2792711 + ... + 2797433.
Almost surely, 213201125056 is an apocalyptic number.
13201125056 is a gapful number since it is divisible by the number (16) 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 13201125056, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15896222208).
13201125056 is an abundant number, since it is smaller than the sum of its proper divisors (18591319360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13201125056 is a wasteful number, since it uses less digits than its factorization.
13201125056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5126 (or 5116 counting only the distinct ones).
The product of its (nonzero) digits is 1800, while the sum is 26.
Adding to 13201125056 its reverse (65052110231), we get a palindrome (78253235287).
The spelling of 13201125056 in words is "thirteen billion, two hundred one million, one hundred twenty-five thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •