Base | Representation |
---|---|
bin | 1011010100010010101111… |
… | …0000010001010010111000 |
3 | 1122001120012210022010112221 |
4 | 2311010223300101102320 |
5 | 3112332241102034202 |
6 | 42244204020413424 |
7 | 2422665304446343 |
oct | 265045360212270 |
9 | 48046183263487 |
10 | 12443254330552 |
11 | 3a68177746a21 |
12 | 148b704847274 |
13 | 6c3517392556 |
14 | 31038463b45a |
15 | 168a26d82037 |
hex | b512bc114b8 |
12443254330552 has 32 divisors (see below), whose sum is σ = 24264984542400. Its totient is φ = 5976848801664.
The previous prime is 12443254330543. The next prime is 12443254330621. The reversal of 12443254330552 is 25503345234421.
It is a super-2 number, since 2×124432543305522 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 12443254330499 and 12443254330508.
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 7 ways as a sum of consecutive naturals, for example, 266040043 + ... + 266086810.
It is an arithmetic number, because the mean of its divisors is an integer number (758280766950).
Almost surely, 212443254330552 is an apocalyptic number.
It is an amenable number.
12443254330552 is a deficient number, since it is larger than the sum of its proper divisors (11821730211848).
12443254330552 is a wasteful number, since it uses less digits than its factorization.
12443254330552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 532126975 (or 532126971 counting only the distinct ones).
The product of its (nonzero) digits is 1728000, while the sum is 43.
Adding to 12443254330552 its reverse (25503345234421), we get a palindrome (37946599564973).
The spelling of 12443254330552 in words is "twelve trillion, four hundred forty-three billion, two hundred fifty-four million, three hundred thirty thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •