Base | Representation |
---|---|
bin | 1011000111010011011111… |
… | …1110111011010110111001 |
3 | 1121021020021020221122202121 |
4 | 2301310313332323112321 |
5 | 3100203302011400212 |
6 | 41553502435201241 |
7 | 2400605665233241 |
oct | 261646776732671 |
9 | 47236236848677 |
10 | 12220121200057 |
11 | 3991584926461 |
12 | 1454411a46221 |
13 | 6a84775408a4 |
14 | 3036580d4b21 |
15 | 162d17aa1d07 |
hex | b1d37fbb5b9 |
12220121200057 has 2 divisors, whose sum is σ = 12220121200058. Its totient is φ = 12220121200056.
The previous prime is 12220121200051. The next prime is 12220121200069. The reversal of 12220121200057 is 75000212102221.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10620455281216 + 1599665918841 = 3258904^2 + 1264779^2 .
It is a cyclic number.
It is not a de Polignac number, because 12220121200057 - 27 = 12220121199929 is a prime.
It is not a weakly prime, because it can be changed into another prime (12220121200051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6110060600028 + 6110060600029.
It is an arithmetic number, because the mean of its divisors is an integer number (6110060600029).
Almost surely, 212220121200057 is an apocalyptic number.
It is an amenable number.
12220121200057 is a deficient number, since it is larger than the sum of its proper divisors (1).
12220121200057 is an equidigital number, since it uses as much as digits as its factorization.
12220121200057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1120, while the sum is 25.
Adding to 12220121200057 its reverse (75000212102221), we get a palindrome (87220333302278).
The spelling of 12220121200057 in words is "twelve trillion, two hundred twenty billion, one hundred twenty-one million, two hundred thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •