Base | Representation |
---|---|
bin | 1011001101011111000110… |
… | …1010011111100110000101 |
3 | 1121122101101010111011201121 |
4 | 2303113301222133212011 |
5 | 3103423243244330431 |
6 | 42114344202153541 |
7 | 2411355410016253 |
oct | 263276152374605 |
9 | 47571333434647 |
10 | 12326315620741 |
11 | 3a226199044a1 |
12 | 1470b0a1b28b1 |
13 | 6b549c49b9c5 |
14 | 30884dad35d3 |
15 | 165980a2a611 |
hex | b35f1a9f985 |
12326315620741 has 8 divisors (see below), whose sum is σ = 12528623288664. Its totient is φ = 12124015595520.
The previous prime is 12326315620733. The next prime is 12326315620807. The reversal of 12326315620741 is 14702651362321.
It can be written as a sum of positive squares in 4 ways, for example, as 2717400590116 + 9608915030625 = 1648454^2 + 3099825^2 .
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 12326315620741 - 23 = 12326315620733 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12326315620721) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1387785 + ... + 5155441.
It is an arithmetic number, because the mean of its divisors is an integer number (1566077911083).
Almost surely, 212326315620741 is an apocalyptic number.
It is an amenable number.
12326315620741 is a deficient number, since it is larger than the sum of its proper divisors (202307667923).
12326315620741 is an equidigital number, since it uses as much as digits as its factorization.
12326315620741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3821351.
The product of its (nonzero) digits is 362880, while the sum is 43.
The spelling of 12326315620741 in words is "twelve trillion, three hundred twenty-six billion, three hundred fifteen million, six hundred twenty thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •