Base | Representation |
---|---|
bin | 101101011111110110100110… |
… | …010101100001001011011001 |
3 | 222020111110201021100222212220 |
4 | 231133312212111201023121 |
5 | 202211423343113341441 |
6 | 1545325050201454253 |
7 | 60101551602253266 |
oct | 5537664625411331 |
9 | 866443637328786 |
10 | 200101022012121 |
11 | 5883840433726a |
12 | 1a538b034a1389 |
13 | 87865a3744a09 |
14 | 375ad266c226d |
15 | 1820147da7466 |
hex | b5fda65612d9 |
200101022012121 has 8 divisors (see below), whose sum is σ = 270456175870560. Its totient is φ = 131573274747552.
The previous prime is 200101022012077. The next prime is 200101022012137. The reversal of 200101022012121 is 121210220101002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200101022012121 - 217 = 200101021881049 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 200101022012121.
It is not an unprimeable number, because it can be changed into a prime (200101022412121) 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, 456851648211 + ... + 456851648648.
It is an arithmetic number, because the mean of its divisors is an integer number (33807021983820).
Almost surely, 2200101022012121 is an apocalyptic number.
It is an amenable number.
200101022012121 is a deficient number, since it is larger than the sum of its proper divisors (70355153858439).
200101022012121 is an equidigital number, since it uses as much as digits as its factorization.
200101022012121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 913703296935.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 200101022012121 its reverse (121210220101002), we get a palindrome (321311242113123).
The spelling of 200101022012121 in words is "two hundred trillion, one hundred one billion, twenty-two million, twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •