Base | Representation |
---|---|
bin | 11011100010010001001101… |
… | …101110110101101100011001 |
3 | 120212210020221200022002211021 |
4 | 123202101031232311230121 |
5 | 111333114302203032301 |
6 | 1105321330015002441 |
7 | 34336226313500200 |
oct | 3342211556655431 |
9 | 525706850262737 |
10 | 121102202002201 |
11 | 356501789a2032 |
12 | 116ba502509421 |
13 | 5275b72487a14 |
14 | 21c9540b76237 |
15 | e0022d5bb8a1 |
hex | 6e244dbb5b19 |
121102202002201 has 18 divisors (see below), whose sum is σ = 148678643296170. Its totient is φ = 98338630182912.
The previous prime is 121102202002081. The next prime is 121102202002207. The reversal of 121102202002201 is 102200202201121.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 121062135974976 + 40066027225 = 11002824^2 + 200165^2 .
It is not a de Polignac number, because 121102202002201 - 233 = 121093612067609 is a prime.
It is not an unprimeable number, because it can be changed into a prime (121102202002207) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 3423075816 + ... + 3423111193.
It is an arithmetic number, because the mean of its divisors is an integer number (8259924627565).
Almost surely, 2121102202002201 is an apocalyptic number.
It is an amenable number.
121102202002201 is a deficient number, since it is larger than the sum of its proper divisors (27576441293969).
121102202002201 is an equidigital number, since it uses as much as digits as its factorization.
121102202002201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6846187061 (or 6846187035 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 121102202002201 its reverse (102200202201121), we get a palindrome (223302404203322).
The spelling of 121102202002201 in words is "one hundred twenty-one trillion, one hundred two billion, two hundred two million, two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •