Base | Representation |
---|---|
bin | 101101100000000001000001… |
… | …010100010100101101111100 |
3 | 222020112112121010111110102122 |
4 | 231200001001110110231330 |
5 | 202212114302244231022 |
6 | 1545334140420142112 |
7 | 60102426110410130 |
oct | 5540010124245574 |
9 | 866475533443378 |
10 | 200112212102012 |
11 | 588421268a9441 |
12 | 1a53b106b37938 |
13 | 8787667b66992 |
14 | 375b6a89153c0 |
15 | 18205a0494742 |
hex | b60041514b7c |
200112212102012 has 48 divisors (see below), whose sum is σ = 437436941856768. Its totient is φ = 78113739605760.
The previous prime is 200112212101897. The next prime is 200112212102059. The reversal of 200112212102012 is 210201212211002.
It is a Harshad number since it is a multiple of its sum of digits (17).
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 15 ways as a sum of consecutive naturals, for example, 6780691808 + ... + 6780721319.
It is an arithmetic number, because the mean of its divisors is an integer number (9113269622016).
Almost surely, 2200112212102012 is an apocalyptic number.
It is an amenable number.
200112212102012 is an abundant number, since it is smaller than the sum of its proper divisors (237324729754756).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200112212102012 is a wasteful number, since it uses less digits than its factorization.
200112212102012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13561413186 (or 13561413184 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 200112212102012 its reverse (210201212211002), we get a palindrome (410313424313014).
The spelling of 200112212102012 in words is "two hundred trillion, one hundred twelve billion, two hundred twelve million, one hundred two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •