Base | Representation |
---|---|
bin | 1011000000100011110100… |
… | …0110101110011001010000 |
3 | 1120212011011111200211221012 |
4 | 2300020331012232121100 |
5 | 3041303442202410300 |
6 | 41424340143350052 |
7 | 2356334266006622 |
oct | 260107506563120 |
9 | 46764144624835 |
10 | 12104243013200 |
11 | 3947420695588 |
12 | 1435a725b2328 |
13 | 69a56b288210 |
14 | 2dbbc4370c12 |
15 | 15ecd48d4435 |
hex | b023d1ae650 |
12104243013200 has 60 divisors (see below), whose sum is σ = 31317401071068. Its totient is φ = 4469258956800.
The previous prime is 12104243013197. The next prime is 12104243013263. The reversal of 12104243013200 is 231034240121.
It can be written as a sum of positive squares in 6 ways, for example, as 2142745571344 + 9961497441856 = 1463812^2 + 3156184^2 .
It is a congruent number.
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 11 ways as a sum of consecutive naturals, for example, 1163864321 + ... + 1163874720.
Almost surely, 212104243013200 is an apocalyptic number.
12104243013200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12104243013200 is an abundant number, since it is smaller than the sum of its proper divisors (19213158057868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12104243013200 is a wasteful number, since it uses less digits than its factorization.
12104243013200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2327739072 (or 2327739061 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 23.
Adding to 12104243013200 its reverse (231034240121), we get a palindrome (12335277253321).
The spelling of 12104243013200 in words is "twelve trillion, one hundred four billion, two hundred forty-three million, thirteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •