Base | Representation |
---|---|
bin | 1011000001100011111001… |
… | …0011110110100110111001 |
3 | 1120220210120012200211212021 |
4 | 2300120332103312212321 |
5 | 3042044203413213423 |
6 | 41440303013114441 |
7 | 2360513442232543 |
oct | 260307623664671 |
9 | 46823505624767 |
10 | 12121443101113 |
11 | 3953747697175 |
12 | 1439272928a21 |
13 | 69c07c866928 |
14 | 2dc976856693 |
15 | 16048e93195d |
hex | b063e4f69b9 |
12121443101113 has 2 divisors, whose sum is σ = 12121443101114. Its totient is φ = 12121443101112.
The previous prime is 12121443101017. The next prime is 12121443101129. The reversal of 12121443101113 is 31110134412121.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11841224267664 + 280218833449 = 3441108^2 + 529357^2 .
It is an emirp because it is prime and its reverse (31110134412121) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12121443101113 is a prime.
It is not a weakly prime, because it can be changed into another prime (12121443101213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6060721550556 + 6060721550557.
It is an arithmetic number, because the mean of its divisors is an integer number (6060721550557).
Almost surely, 212121443101113 is an apocalyptic number.
It is an amenable number.
12121443101113 is a deficient number, since it is larger than the sum of its proper divisors (1).
12121443101113 is an equidigital number, since it uses as much as digits as its factorization.
12121443101113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 576, while the sum is 25.
Adding to 12121443101113 its reverse (31110134412121), we get a palindrome (43231577513234).
The spelling of 12121443101113 in words is "twelve trillion, one hundred twenty-one billion, four hundred forty-three million, one hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •