Base | Representation |
---|---|
bin | 11011100011111111110111… |
… | …110110010011010011100011 |
3 | 120220012121122022201001111201 |
4 | 123203333313312103103203 |
5 | 111342041122132432321 |
6 | 1105452100133222031 |
7 | 34350633612515446 |
oct | 3343776766232343 |
9 | 526177568631451 |
10 | 121221020202211 |
11 | 35696600751346 |
12 | 11719542491917 |
13 | 5284129880947 |
14 | 21d11b316965d |
15 | e0338492e291 |
hex | 6e3ff7d934e3 |
121221020202211 has 4 divisors (see below), whose sum is σ = 121221195463800. Its totient is φ = 121220844940624.
The previous prime is 121221020202209. The next prime is 121221020202229. The reversal of 121221020202211 is 112202020122121.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 121221020202211 - 21 = 121221020202209 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121221020200211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 86589181 + ... + 87977998.
It is an arithmetic number, because the mean of its divisors is an integer number (30305298865950).
Almost surely, 2121221020202211 is an apocalyptic number.
121221020202211 is a deficient number, since it is larger than the sum of its proper divisors (175261589).
121221020202211 is an equidigital number, since it uses as much as digits as its factorization.
121221020202211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 175261588.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 121221020202211 its reverse (112202020122121), we get a palindrome (233423040324332).
The spelling of 121221020202211 in words is "one hundred twenty-one trillion, two hundred twenty-one billion, twenty million, two hundred two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •