Base | Representation |
---|---|
bin | 11000100101100110… |
… | …01110111001000000 |
3 | 1021001221201211201222 |
4 | 30102303032321000 |
5 | 204013240301422 |
6 | 10021504414212 |
7 | 645054613055 |
oct | 142263167100 |
9 | 37057654658 |
10 | 13200322112 |
11 | 566426841a |
12 | 2684917368 |
13 | 1324a3c7b3 |
14 | 8d31d302c |
15 | 523d21842 |
hex | 312ccee40 |
13200322112 has 56 divisors (see below), whose sum is σ = 27856875960. Its totient is φ = 6184673280.
The previous prime is 13200322087. The next prime is 13200322139. The reversal of 13200322112 is 21122300231.
It can be written as a sum of positive squares in 4 ways, for example, as 11038444096 + 2161878016 = 105064^2 + 46496^2 .
It is a super-2 number, since 2×132003221122 (a number of 21 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 222662 + ... + 275642.
Almost surely, 213200322112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 13200322112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13928437980).
13200322112 is an abundant number, since it is smaller than the sum of its proper divisors (14656553848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13200322112 is a wasteful number, since it uses less digits than its factorization.
13200322112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53239 (or 53229 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 13200322112 its reverse (21122300231), we get a palindrome (34322622343).
The spelling of 13200322112 in words is "thirteen billion, two hundred million, three hundred twenty-two thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •