Base | Representation |
---|---|
bin | 1011001000100010110011… |
… | …1010111010000000010011 |
3 | 1121100021012221101202012012 |
4 | 2302020230322322000103 |
5 | 3101030402032324133 |
6 | 42011343141253135 |
7 | 2402261363565011 |
oct | 262105472720023 |
9 | 47307187352165 |
10 | 12241410433043 |
11 | 399a60a069290 |
12 | 14585737041ab |
13 | 6aa48b05377c |
14 | 3046b76d78b1 |
15 | 163661ad2b48 |
hex | b222ceba013 |
12241410433043 has 8 divisors (see below), whose sum is σ = 13483918995456. Its totient is φ = 11020510715400.
The previous prime is 12241410433019. The next prime is 12241410433069. The reversal of 12241410433043 is 34033401414221.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12241410433043 - 216 = 12241410367507 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12241410433013) by changing a digit.
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, 5402210003 + ... + 5402212268.
It is an arithmetic number, because the mean of its divisors is an integer number (1685489874432).
Almost surely, 212241410433043 is an apocalyptic number.
12241410433043 is a deficient number, since it is larger than the sum of its proper divisors (1242508562413).
12241410433043 is a wasteful number, since it uses less digits than its factorization.
12241410433043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10804422385.
The product of its (nonzero) digits is 27648, while the sum is 32.
Adding to 12241410433043 its reverse (34033401414221), we get a palindrome (46274811847264).
The spelling of 12241410433043 in words is "twelve trillion, two hundred forty-one billion, four hundred ten million, four hundred thirty-three thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •