Base | Representation |
---|---|
bin | 1011001101001100000011… |
… | …1000110000101111010101 |
3 | 1121121220011202220002012001 |
4 | 2303103000320300233111 |
5 | 3103332310242410401 |
6 | 42112140542155301 |
7 | 2411114610421126 |
oct | 263230070605725 |
9 | 47556152802161 |
10 | 12321202310101 |
11 | 3a20435544533 |
12 | 146bb21882b31 |
13 | 6b4b66018bc9 |
14 | 3084c697804d |
15 | 165781b90601 |
hex | b34c0e30bd5 |
12321202310101 has 4 divisors (see below), whose sum is σ = 12607741898752. Its totient is φ = 12034662721452.
The previous prime is 12321202310089. The next prime is 12321202310107. The reversal of 12321202310101 is 10101320212321.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 12321202310101 - 213 = 12321202301909 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 (12321202310107) 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, 143269794261 + ... + 143269794346.
It is an arithmetic number, because the mean of its divisors is an integer number (3151935474688).
Almost surely, 212321202310101 is an apocalyptic number.
It is an amenable number.
12321202310101 is a deficient number, since it is larger than the sum of its proper divisors (286539588651).
12321202310101 is an equidigital number, since it uses as much as digits as its factorization.
12321202310101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 286539588650.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 12321202310101 its reverse (10101320212321), we get a palindrome (22422522522422).
The spelling of 12321202310101 in words is "twelve trillion, three hundred twenty-one billion, two hundred two million, three hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •