Base | Representation |
---|---|
bin | 11011100010010001000010… |
… | …010010110111111111100011 |
3 | 120212210020110022020120221222 |
4 | 123202101002102313333203 |
5 | 111333113404042402321 |
6 | 1105321255002205255 |
7 | 34336221463522256 |
oct | 3342210222677743 |
9 | 525706408216858 |
10 | 121102010122211 |
11 | 3565008a655828 |
12 | 116ba46a1b382b |
13 | 5275b417b4671 |
14 | 21c95234a909d |
15 | e0021b8183ab |
hex | 6e24424b7fe3 |
121102010122211 has 8 divisors (see below), whose sum is σ = 121480437940224. Its totient is φ = 120723906443400.
The previous prime is 121102010122201. The next prime is 121102010122273. The reversal of 121102010122211 is 112221010201121.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 121102010122211 - 26 = 121102010122147 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 121102010122211.
It is not an unprimeable number, because it can be changed into a prime (121102010122201) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 80286401 + ... + 81780866.
It is an arithmetic number, because the mean of its divisors is an integer number (15185054742528).
Almost surely, 2121102010122211 is an apocalyptic number.
121102010122211 is a deficient number, since it is larger than the sum of its proper divisors (378427818013).
121102010122211 is a wasteful number, since it uses less digits than its factorization.
121102010122211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 162069601.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 121102010122211 its reverse (112221010201121), we get a palindrome (233323020323332).
The spelling of 121102010122211 in words is "one hundred twenty-one trillion, one hundred two billion, ten million, one hundred twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •