Base | Representation |
---|---|
bin | 1011000001000101010011… |
… | …0010001000100011011101 |
3 | 1120220000100211200101210102 |
4 | 2300101110302020203131 |
5 | 3041430343412444401 |
6 | 41432424030150445 |
7 | 2360103064605506 |
oct | 260212462104335 |
9 | 46800324611712 |
10 | 12113230203101 |
11 | 3950212727355 |
12 | 1437760352425 |
13 | 69b3711a1871 |
14 | 2dc3d7badbad |
15 | 16015d8d056b |
hex | b0454c888dd |
12113230203101 has 2 divisors, whose sum is σ = 12113230203102. Its totient is φ = 12113230203100.
The previous prime is 12113230202999. The next prime is 12113230203103. The reversal of 12113230203101 is 10130203231121.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6632036175076 + 5481194028025 = 2575274^2 + 2341195^2 .
It is a cyclic number.
It is not a de Polignac number, because 12113230203101 - 218 = 12113229940957 is a prime.
Together with 12113230203103, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12113230203103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6056615101550 + 6056615101551.
It is an arithmetic number, because the mean of its divisors is an integer number (6056615101551).
Almost surely, 212113230203101 is an apocalyptic number.
It is an amenable number.
12113230203101 is a deficient number, since it is larger than the sum of its proper divisors (1).
12113230203101 is an equidigital number, since it uses as much as digits as its factorization.
12113230203101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 12113230203101 its reverse (10130203231121), we get a palindrome (22243433434222).
The spelling of 12113230203101 in words is "twelve trillion, one hundred thirteen billion, two hundred thirty million, two hundred three thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •