Base | Representation |
---|---|
bin | 1011101010010101000… |
… | …0110001011110011100 |
3 | 201011010010012001021211 |
4 | 2322211100301132130 |
5 | 11240244312230322 |
6 | 232011353434204 |
7 | 20321432351323 |
oct | 2724520613634 |
9 | 634103161254 |
10 | 200341133212 |
11 | 77a6738a680 |
12 | 329b1a0b964 |
13 | 15b79bbc54c |
14 | 99a75210ba |
15 | 53283aab77 |
hex | 2ea543179c |
200341133212 has 24 divisors (see below), whose sum is σ = 382511373552. Its totient is φ = 91054166400.
The previous prime is 200341133183. The next prime is 200341133221. The reversal of 200341133212 is 212331143002.
200341133212 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (22).
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, 163912 + ... + 653872.
It is an arithmetic number, because the mean of its divisors is an integer number (15937973898).
Almost surely, 2200341133212 is an apocalyptic number.
200341133212 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
200341133212 is a deficient number, since it is larger than the sum of its proper divisors (182170240340).
200341133212 is a wasteful number, since it uses less digits than its factorization.
200341133212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 499269 (or 499267 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 200341133212 its reverse (212331143002), we get a palindrome (412672276214).
The spelling of 200341133212 in words is "two hundred billion, three hundred forty-one million, one hundred thirty-three thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •