Base | Representation |
---|---|
bin | 11011010010010000100100… |
… | …101001011110010101010001 |
3 | 120201220002010210012120001022 |
4 | 123102100210221132111101 |
5 | 111212103044240232121 |
6 | 1103120054103245225 |
7 | 34163600312236223 |
oct | 3322204451362521 |
9 | 521802123176038 |
10 | 120002001102161 |
11 | 352666211a3952 |
12 | 11561237449815 |
13 | 51c61a8b9b8a9 |
14 | 218c1b0b34413 |
15 | dd17da184aab |
hex | 6d2424a5e551 |
120002001102161 has 2 divisors, whose sum is σ = 120002001102162. Its totient is φ = 120002001102160.
The previous prime is 120002001102107. The next prime is 120002001102163. The reversal of 120002001102161 is 161201100200021.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 113905052462161 + 6096948640000 = 10672631^2 + 2469200^2 .
It is a cyclic number.
It is not a de Polignac number, because 120002001102161 - 214 = 120002001085777 is a prime.
Together with 120002001102163, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (120002001102163) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 60001000551080 + 60001000551081.
It is an arithmetic number, because the mean of its divisors is an integer number (60001000551081).
Almost surely, 2120002001102161 is an apocalyptic number.
It is an amenable number.
120002001102161 is a deficient number, since it is larger than the sum of its proper divisors (1).
120002001102161 is an equidigital number, since it uses as much as digits as its factorization.
120002001102161 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 17.
Adding to 120002001102161 its reverse (161201100200021), we get a palindrome (281203101302182).
The spelling of 120002001102161 in words is "one hundred twenty trillion, two billion, one million, one hundred two thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •