Base | Representation |
---|---|
bin | 1011101001011011100… |
… | …1110001010001000110 |
3 | 201010111022212111021011 |
4 | 2322112321301101012 |
5 | 11234301124101042 |
6 | 231531430112434 |
7 | 20312445552331 |
oct | 2722671612106 |
9 | 633438774234 |
10 | 200100222022 |
11 | 779533a4518 |
12 | 329451ab71a |
13 | 15b3c00ca4c |
14 | 998352d618 |
15 | 531216ea17 |
hex | 2e96e71446 |
200100222022 has 8 divisors (see below), whose sum is σ = 300348981072. Its totient is φ = 99983895000.
The previous prime is 200100221929. The next prime is 200100222073. The reversal of 200100222022 is 220222001002.
200100222022 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 200100221993 and 200100222011.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 33104229 + ... + 33110272.
It is an arithmetic number, because the mean of its divisors is an integer number (37543622634).
Almost surely, 2200100222022 is an apocalyptic number.
200100222022 is a deficient number, since it is larger than the sum of its proper divisors (100248759050).
200100222022 is a wasteful number, since it uses less digits than its factorization.
200100222022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66216014.
The product of its (nonzero) digits is 64, while the sum is 13.
Adding to 200100222022 its reverse (220222001002), we get a palindrome (420322223024).
It can be divided in two parts, 2001002 and 22022, that multiplied together give a palindrome (44066066044).
The spelling of 200100222022 in words is "two hundred billion, one hundred million, two hundred twenty-two thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •