Base | Representation |
---|---|
bin | 101101100001011100000110… |
… | …100101100001000100100001 |
3 | 222020212220000220101021220010 |
4 | 231201130012211201010201 |
5 | 202220220100304013441 |
6 | 1545451113114035133 |
7 | 60112460466342642 |
oct | 5541340645410441 |
9 | 866786026337803 |
10 | 200210011001121 |
11 | 5887a6528228a0 |
12 | 1a55605b718aa9 |
13 | 879395264a954 |
14 | 37623054cd6c9 |
15 | 1822dc6346116 |
hex | b61706961121 |
200210011001121 has 32 divisors (see below), whose sum is σ = 306616541690880. Its totient is φ = 114925029595200.
The previous prime is 200210011001111. The next prime is 200210011001137. The reversal of 200210011001121 is 121100110012002.
It is not a de Polignac number, because 200210011001121 - 245 = 165025638912289 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 200210011001097 and 200210011001106.
It is not an unprimeable number, because it can be changed into a prime (200210011001111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 36441045 + ... + 41573666.
It is an arithmetic number, because the mean of its divisors is an integer number (9581766927840).
Almost surely, 2200210011001121 is an apocalyptic number.
It is an amenable number.
200210011001121 is a deficient number, since it is larger than the sum of its proper divisors (106406530689759).
200210011001121 is a wasteful number, since it uses less digits than its factorization.
200210011001121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78018837.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 200210011001121 its reverse (121100110012002), we get a palindrome (321310121013123).
The spelling of 200210011001121 in words is "two hundred trillion, two hundred ten billion, eleven million, one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •