Base | Representation |
---|---|
bin | 1011010110101101100101… |
… | …0101011111100010010011 |
3 | 1122012112111122210112112010 |
4 | 2311223121111133202103 |
5 | 3114022403220032433 |
6 | 42315240412034003 |
7 | 2425666336451064 |
oct | 265533125374223 |
9 | 48175448715463 |
10 | 12484821252243 |
11 | 3a8386813346a |
12 | 1497785462903 |
13 | 6c740cc686c2 |
14 | 3123a8d6c56b |
15 | 169b5b1d1e63 |
hex | b5ad955f893 |
12484821252243 has 4 divisors (see below), whose sum is σ = 16646428336328. Its totient is φ = 8323214168160.
The previous prime is 12484821252181. The next prime is 12484821252247. The reversal of 12484821252243 is 34225212848421.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 12484821252243 - 221 = 12484819155091 is a prime.
It is a super-4 number, since 4×124848212522434 (a number of 53 digits) contains 4444 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12484821252192 and 12484821252201.
It is not an unprimeable number, because it can be changed into a prime (12484821252247) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2080803542038 + ... + 2080803542043.
It is an arithmetic number, because the mean of its divisors is an integer number (4161607084082).
Almost surely, 212484821252243 is an apocalyptic number.
12484821252243 is a deficient number, since it is larger than the sum of its proper divisors (4161607084085).
12484821252243 is an equidigital number, since it uses as much as digits as its factorization.
12484821252243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4161607084084.
The product of its digits is 1966080, while the sum is 48.
The spelling of 12484821252243 in words is "twelve trillion, four hundred eighty-four billion, eight hundred twenty-one million, two hundred fifty-two thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •