Base | Representation |
---|---|
bin | 11011100010011010100111… |
… | …101111010010000000100011 |
3 | 120212211020000120020021011201 |
4 | 123202122213233102000203 |
5 | 111333300443303032321 |
6 | 1105330120133022031 |
7 | 34340034514204312 |
oct | 3342324757220043 |
9 | 525736016207151 |
10 | 121112302002211 |
11 | 356544910a8583 |
12 | 11700460a84917 |
13 | 5276ac1ab89a0 |
14 | 21c9c1c2ca279 |
15 | e0062012e291 |
hex | 6e26a7bd2023 |
121112302002211 has 8 divisors (see below), whose sum is σ = 130714034754464. Its totient is φ = 111551340939840.
The previous prime is 121112302002161. The next prime is 121112302002217. The reversal of 121112302002211 is 112200203211121.
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 121112302002211 - 29 = 121112302001699 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121112302002217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10192916295 + ... + 10192928176.
It is an arithmetic number, because the mean of its divisors is an integer number (16339254344308).
Almost surely, 2121112302002211 is an apocalyptic number.
121112302002211 is a deficient number, since it is larger than the sum of its proper divisors (9601732752253).
121112302002211 is a wasteful number, since it uses less digits than its factorization.
121112302002211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20385844941.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 121112302002211 its reverse (112200203211121), we get a palindrome (233312505213332).
The spelling of 121112302002211 in words is "one hundred twenty-one trillion, one hundred twelve billion, three hundred two million, two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •