Base | Representation |
---|---|
bin | 101101100001011101001110… |
… | …000011101101110110011001 |
3 | 222020220000010110200211111012 |
4 | 231201131032003231312121 |
5 | 202220230024241200441 |
6 | 1545451432110543305 |
7 | 60112532266456253 |
oct | 5541351603556631 |
9 | 866800113624435 |
10 | 200211210100121 |
11 | 58880108673700 |
12 | 1a556335207b35 |
13 | 8793ab3bb7c9c |
14 | 37623ba866cd3 |
15 | 1822e467549eb |
hex | b6174e0edd99 |
200211210100121 has 12 divisors (see below), whose sum is σ = 220094243275200. Its totient is φ = 181987549216440.
The previous prime is 200211210100087. The next prime is 200211210100151. The reversal of 200211210100121 is 121001012112002.
It is a de Polignac number, because none of the positive numbers 2k-200211210100121 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200211210100096 and 200211210100105.
It is not an unprimeable number, because it can be changed into a prime (200211210100151) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 101940461 + ... + 103885898.
It is an arithmetic number, because the mean of its divisors is an integer number (18341186939600).
Almost surely, 2200211210100121 is an apocalyptic number.
It is an amenable number.
200211210100121 is a deficient number, since it is larger than the sum of its proper divisors (19883033175079).
200211210100121 is a wasteful number, since it uses less digits than its factorization.
200211210100121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 205834420 (or 205834409 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 200211210100121 its reverse (121001012112002), we get a palindrome (321212222212123).
The spelling of 200211210100121 in words is "two hundred trillion, two hundred eleven billion, two hundred ten million, one hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •