Base | Representation |
---|---|
bin | 1011101001011011100… |
… | …1101011111100011101 |
3 | 201010111022211101100201 |
4 | 2322112321223330131 |
5 | 11234301122401341 |
6 | 231531425423501 |
7 | 20312445431635 |
oct | 2722671537435 |
9 | 633438741321 |
10 | 200100200221 |
11 | 7795338a0a9 |
12 | 3294519ab91 |
13 | 15b3c002b4c |
14 | 99835256c5 |
15 | 5312168331 |
hex | 2e96e6bf1d |
200100200221 has 4 divisors (see below), whose sum is σ = 211870800252. Its totient is φ = 188329600192.
The previous prime is 200100200219. The next prime is 200100200227. The reversal of 200100200221 is 122002001002.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 102153108996 + 97947091225 = 319614^2 + 312965^2 .
It is not a de Polignac number, because 200100200221 - 21 = 200100200219 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 200100200198 and 200100200207.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200100200227) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5885299990 + ... + 5885300023.
It is an arithmetic number, because the mean of its divisors is an integer number (52967700063).
Almost surely, 2200100200221 is an apocalyptic number.
It is an amenable number.
200100200221 is a deficient number, since it is larger than the sum of its proper divisors (11770600031).
200100200221 is a wasteful number, since it uses less digits than its factorization.
200100200221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11770600030.
The product of its (nonzero) digits is 16, while the sum is 10.
Adding to 200100200221 its reverse (122002001002), we get a palindrome (322102201223).
The spelling of 200100200221 in words is "two hundred billion, one hundred million, two hundred thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •