Base | Representation |
---|---|
bin | 1011001101001100011101… |
… | …0100010101010111011111 |
3 | 1121121220110021220112002210 |
4 | 2303103013110111113133 |
5 | 3103333020402420221 |
6 | 42112155354451503 |
7 | 2411120360450556 |
oct | 263230724252737 |
9 | 47556407815083 |
10 | 12321310201311 |
11 | 3a20490435821 |
12 | 146bb51a33b93 |
13 | 6b4b82493467 |
14 | 3084d7020d9d |
15 | 16578b3a3276 |
hex | b34c75155df |
12321310201311 has 8 divisors (see below), whose sum is σ = 16428571045120. Its totient is φ = 8214128079192.
The previous prime is 12321310201273. The next prime is 12321310201313. The reversal of 12321310201311 is 11310201312321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-12321310201311 is a prime.
It is a super-2 number, since 2×123213102013112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12321310201313) 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, 19314241 + ... + 19941978.
It is an arithmetic number, because the mean of its divisors is an integer number (2053571380640).
Almost surely, 212321310201311 is an apocalyptic number.
12321310201311 is a deficient number, since it is larger than the sum of its proper divisors (4107260843809).
12321310201311 is a wasteful number, since it uses less digits than its factorization.
12321310201311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39360845.
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 12321310201311 its reverse (11310201312321), we get a palindrome (23631511513632).
The spelling of 12321310201311 in words is "twelve trillion, three hundred twenty-one billion, three hundred ten million, two hundred one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •