Base | Representation |
---|---|
bin | 1011000000010100000001… |
… | …0101010011111000011001 |
3 | 1120211202012221212021101212 |
4 | 2300011000111103320121 |
5 | 3041221301030413423 |
6 | 41422355252152505 |
7 | 2356124222466161 |
oct | 260050025237031 |
9 | 46752187767355 |
10 | 12100002201113 |
11 | 3945644883702 |
12 | 143508a308735 |
13 | 69a0437c0158 |
14 | 2db9010535a1 |
15 | 15eb37442578 |
hex | b0140553e19 |
12100002201113 has 2 divisors, whose sum is σ = 12100002201114. Its totient is φ = 12100002201112.
The previous prime is 12100002200977. The next prime is 12100002201173. The reversal of 12100002201113 is 31110220000121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10400347651849 + 1699654549264 = 3224957^2 + 1303708^2 .
It is a cyclic number.
It is not a de Polignac number, because 12100002201113 - 28 = 12100002200857 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (12100002201173) 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 as a sum of consecutive naturals, namely, 6050001100556 + 6050001100557.
It is an arithmetic number, because the mean of its divisors is an integer number (6050001100557).
Almost surely, 212100002201113 is an apocalyptic number.
It is an amenable number.
12100002201113 is a deficient number, since it is larger than the sum of its proper divisors (1).
12100002201113 is an equidigital number, since it uses as much as digits as its factorization.
12100002201113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 12100002201113 its reverse (31110220000121), we get a palindrome (43210222201234).
The spelling of 12100002201113 in words is "twelve trillion, one hundred billion, two million, two hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •