Base | Representation |
---|---|
bin | 101101100001011101001110… |
… | …000111001110111100101001 |
3 | 222020220000010112102200020100 |
4 | 231201131032013032330221 |
5 | 202220230030010201441 |
6 | 1545451432142420013 |
7 | 60112532310346305 |
oct | 5541351607167451 |
9 | 866800115380210 |
10 | 200211211022121 |
11 | 58880109143392 |
12 | 1a556335591609 |
13 | 8793ab414b850 |
14 | 37623baa26d05 |
15 | 1822e46887cb6 |
hex | b6174e1cef29 |
200211211022121 has 96 divisors (see below), whose sum is σ = 330283589767040. Its totient is φ = 115850817119232.
The previous prime is 200211211021981. The next prime is 200211211022191. The reversal of 200211211022121 is 121220112112002.
200211211022121 is a `hidden beast` number, since 2 + 0 + 0 + 211 + 211 + 0 + 221 + 21 = 666.
It is not a de Polignac number, because 200211211022121 - 213 = 200211211013929 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 200211211022094 and 200211211022103.
It is not an unprimeable number, because it can be changed into a prime (200211211022191) by changing a digit.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 316236741 + ... + 316869213.
Almost surely, 2200211211022121 is an apocalyptic number.
It is an amenable number.
200211211022121 is a deficient number, since it is larger than the sum of its proper divisors (130072378744919).
200211211022121 is a wasteful number, since it uses less digits than its factorization.
200211211022121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 633575 (or 633572 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 200211211022121 its reverse (121220112112002), we get a palindrome (321431323134123).
The spelling of 200211211022121 in words is "two hundred trillion, two hundred eleven billion, two hundred eleven million, twenty-two thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •