Base | Representation |
---|---|
bin | 1100000010111010001010… |
… | …1111100001101010010000 |
3 | 1201220010101010002002201012 |
4 | 3000232202233201222100 |
5 | 3213442421310304300 |
6 | 44100132350230052 |
7 | 2534566335100214 |
oct | 300564257415220 |
9 | 51803333062635 |
10 | 13244114541200 |
11 | 4246885426704 |
12 | 159a96b1b5328 |
13 | 750bb76138ba |
14 | 33b038d22944 |
15 | 17e79a941435 |
hex | c0ba2be1a90 |
13244114541200 has 30 divisors (see below), whose sum is σ = 31818985186194. Its totient is φ = 5297645816320.
The previous prime is 13244114541193. The next prime is 13244114541223. The reversal of 13244114541200 is 214541144231.
It can be written as a sum of positive squares in 3 ways, for example, as 114536218624 + 13129578322576 = 338432^2 + 3623476^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 16555142777 + ... + 16555143576.
Almost surely, 213244114541200 is an apocalyptic number.
13244114541200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
13244114541200 is an abundant number, since it is smaller than the sum of its proper divisors (18574870644994).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13244114541200 is a wasteful number, since it uses less digits than its factorization.
13244114541200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33110286371 (or 33110286360 counting only the distinct ones).
The product of its (nonzero) digits is 15360, while the sum is 32.
Adding to 13244114541200 its reverse (214541144231), we get a palindrome (13458655685431).
The spelling of 13244114541200 in words is "thirteen trillion, two hundred forty-four billion, one hundred fourteen million, five hundred forty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •