Base | Representation |
---|---|
bin | 1011001000101001100001… |
… | …0011111000101011000100 |
3 | 1121100102212111122010000201 |
4 | 2302022120103320223010 |
5 | 3101043044302041200 |
6 | 42012242022220244 |
7 | 2402354132064415 |
oct | 262123023705304 |
9 | 47312774563021 |
10 | 12243212143300 |
11 | 39a0354090926 |
12 | 1458996b84684 |
13 | 6aa6b73c2108 |
14 | 304808ad780c |
15 | 163719d77c6a |
hex | b22984f8ac4 |
12243212143300 has 18 divisors (see below), whose sum is σ = 26567770351178. Its totient is φ = 4897284857280.
The previous prime is 12243212143273. The next prime is 12243212143333. The reversal of 12243212143300 is 334121234221.
It can be written as a sum of positive squares in 3 ways, for example, as 754271406144 + 11488940737156 = 868488^2 + 3389534^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, 61216060617 + ... + 61216060816.
Almost surely, 212243212143300 is an apocalyptic number.
12243212143300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12243212143300 is an abundant number, since it is smaller than the sum of its proper divisors (14324558207878).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12243212143300 is a wasteful number, since it uses less digits than its factorization.
12243212143300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 122432121447 (or 122432121440 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 12243212143300 its reverse (334121234221), we get a palindrome (12577333377521).
The spelling of 12243212143300 in words is "twelve trillion, two hundred forty-three billion, two hundred twelve million, one hundred forty-three thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •