Base | Representation |
---|---|
bin | 111000010110101101… |
… | …0100011111111111001 |
3 | 102120101011101220122112 |
4 | 1300231122203333321 |
5 | 3440322340202301 |
6 | 131332444302105 |
7 | 11513004500342 |
oct | 1605532437771 |
9 | 376334356575 |
10 | 121021022201 |
11 | 47363237222 |
12 | 1b555841935 |
13 | b5488a5011 |
14 | 5c00ba70c9 |
15 | 323493a9bb |
hex | 1c2d6a3ff9 |
121021022201 has 4 divisors (see below), whose sum is σ = 121055912100. Its totient is φ = 120986132304.
The previous prime is 121021022197. The next prime is 121021022219. The reversal of 121021022201 is 102220120121.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2563903225 + 118457118976 = 50635^2 + 344176^2 .
It is a cyclic number.
It is not a de Polignac number, because 121021022201 - 22 = 121021022197 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (121021022231) 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 3 ways as a sum of consecutive naturals, for example, 17439746 + ... + 17446683.
It is an arithmetic number, because the mean of its divisors is an integer number (30263978025).
Almost surely, 2121021022201 is an apocalyptic number.
It is an amenable number.
121021022201 is a deficient number, since it is larger than the sum of its proper divisors (34889899).
121021022201 is an equidigital number, since it uses as much as digits as its factorization.
121021022201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34889898.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 121021022201 its reverse (102220120121), we get a palindrome (223241142322).
The spelling of 121021022201 in words is "one hundred twenty-one billion, twenty-one million, twenty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •