Base | Representation |
---|---|
bin | 101101100001010011111001… |
… | …100010100110111000111001 |
3 | 222020212001022000001211121020 |
4 | 231201103321202212320321 |
5 | 202220044030230400441 |
6 | 1545443055042533053 |
7 | 60112026264642243 |
oct | 5541237142467071 |
9 | 866761260054536 |
10 | 200201202200121 |
11 | 58876942453271 |
12 | 1a554401667189 |
13 | 8792b7a692a75 |
14 | 3761b0b649093 |
15 | 1822a5cd35e66 |
hex | b614f98a6e39 |
200201202200121 has 8 divisors (see below), whose sum is σ = 266999868157824. Its totient is φ = 133435002187920.
The previous prime is 200201202200099. The next prime is 200201202200123. The reversal of 200201202200121 is 121002202102002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 200201202200121 - 223 = 200201193811513 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 200201202200121.
It is not an unprimeable number, because it can be changed into a prime (200201202200123) 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, 8116471986 + ... + 8116496651.
It is an arithmetic number, because the mean of its divisors is an integer number (33374983519728).
Almost surely, 2200201202200121 is an apocalyptic number.
It is an amenable number.
200201202200121 is a deficient number, since it is larger than the sum of its proper divisors (66798665957703).
200201202200121 is a wasteful number, since it uses less digits than its factorization.
200201202200121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16232972751.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 200201202200121 its reverse (121002202102002), we get a palindrome (321203404302123).
The spelling of 200201202200121 in words is "two hundred trillion, two hundred one billion, two hundred two million, two hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •