Base | Representation |
---|---|
bin | 1011001101010100000000… |
… | …0101110011001001000001 |
3 | 1121122002200111121211010212 |
4 | 2303111000011303021001 |
5 | 3103401143111343431 |
6 | 42113132420003505 |
7 | 2411221523241320 |
oct | 263250005631101 |
9 | 47562614554125 |
10 | 12323336434241 |
11 | 3a2133016a598 |
12 | 1470418530595 |
13 | 6b51161c3c61 |
14 | 30864a1880b7 |
15 | 1658591e872b |
hex | b3540173241 |
12323336434241 has 8 divisors (see below), whose sum is σ = 14117425990080. Its totient is φ = 10537650109008.
The previous prime is 12323336434217. The next prime is 12323336434249. The reversal of 12323336434241 is 14243463332321.
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 12323336434241 - 210 = 12323336433217 is a prime.
It is not an unprimeable number, because it can be changed into a prime (12323336434249) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2100804506 + ... + 2100810371.
It is an arithmetic number, because the mean of its divisors is an integer number (1764678248760).
Almost surely, 212323336434241 is an apocalyptic number.
It is an amenable number.
12323336434241 is a deficient number, since it is larger than the sum of its proper divisors (1794089555839).
12323336434241 is an equidigital number, since it uses as much as digits as its factorization.
12323336434241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4201615303.
The product of its digits is 746496, while the sum is 41.
Adding to 12323336434241 its reverse (14243463332321), we get a palindrome (26566799766562).
The spelling of 12323336434241 in words is "twelve trillion, three hundred twenty-three billion, three hundred thirty-six million, four hundred thirty-four thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •