Base | Representation |
---|---|
bin | 1011101001111000001… |
… | …1000111010101010100 |
3 | 201010210200110112200120 |
4 | 2322132003013111110 |
5 | 11240022322042322 |
6 | 231551351511540 |
7 | 20315432605401 |
oct | 2723603072524 |
9 | 633720415616 |
10 | 200220112212 |
11 | 77a0504081a |
12 | 329793885b0 |
13 | 15b5aac89a3 |
14 | 999541b2a8 |
15 | 531c952a5c |
hex | 2e9e0c7554 |
200220112212 has 24 divisors (see below), whose sum is σ = 467757763200. Its totient is φ = 66657537216.
The previous prime is 200220112153. The next prime is 200220112243. The reversal of 200220112212 is 212211022002.
200220112212 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 200220112191 and 200220112200.
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 7 ways as a sum of consecutive naturals, for example, 10302412 + ... + 10321827.
It is an arithmetic number, because the mean of its divisors is an integer number (19489906800).
Almost surely, 2200220112212 is an apocalyptic number.
It is an amenable number.
200220112212 is an abundant number, since it is smaller than the sum of its proper divisors (267537650988).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200220112212 is a wasteful number, since it uses less digits than its factorization.
200220112212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20625055 (or 20625053 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 200220112212 its reverse (212211022002), we get a palindrome (412431134214).
The spelling of 200220112212 in words is "two hundred billion, two hundred twenty million, one hundred twelve thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •