Base | Representation |
---|---|
bin | 11011100010010001001000… |
… | …010000101001000110001001 |
3 | 120212210020201021120002011012 |
4 | 123202101020100221012021 |
5 | 111333114110202401301 |
6 | 1105321312535213305 |
7 | 34336224120260654 |
oct | 3342211020510611 |
9 | 525706637502135 |
10 | 121102110200201 |
11 | 3565013109a909 |
12 | 116ba497817235 |
13 | 5275b59454800 |
14 | 21c95328ba89b |
15 | e002254d5ebb |
hex | 6e2448429189 |
121102110200201 has 24 divisors (see below), whose sum is σ = 131721921360000. Its totient is φ = 111285864161472.
The previous prime is 121102110200153. The next prime is 121102110200209. The reversal of 121102110200201 is 102002011201121.
It is not a de Polignac number, because 121102110200201 - 210 = 121102110199177 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121102110200209) 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 in 23 ways as a sum of consecutive naturals, for example, 136442750 + ... + 137327448.
It is an arithmetic number, because the mean of its divisors is an integer number (5488413390000).
Almost surely, 2121102110200201 is an apocalyptic number.
It is an amenable number.
121102110200201 is a deficient number, since it is larger than the sum of its proper divisors (10619811159799).
121102110200201 is a wasteful number, since it uses less digits than its factorization.
121102110200201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 888353 (or 888340 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 121102110200201 its reverse (102002011201121), we get a palindrome (223104121401322).
The spelling of 121102110200201 in words is "one hundred twenty-one trillion, one hundred two billion, one hundred ten million, two hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •