Base | Representation |
---|---|
bin | 101101011110011000100001… |
… | …000001011001011101100110 |
3 | 222020010210221221201222001200 |
4 | 231132120201001121131212 |
5 | 202203300000241320402 |
6 | 1545210422045303330 |
7 | 60061344320661231 |
oct | 5536304101313546 |
9 | 866123857658050 |
10 | 200000001120102 |
11 | 587a9584708957 |
12 | 1a52140b864b46 |
13 | 8779bc4591971 |
14 | 37560a1c36418 |
15 | 181c6d421121c |
hex | b5e621059766 |
200000001120102 has 24 divisors (see below), whose sum is σ = 436745409275136. Its totient is φ = 66141732653136.
The previous prime is 200000001120089. The next prime is 200000001120107. The reversal of 200000001120102 is 201021100000002.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200000001120107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 43744529893 + ... + 43744534464.
It is an arithmetic number, because the mean of its divisors is an integer number (18197725386464).
Almost surely, 2200000001120102 is an apocalyptic number.
200000001120102 is an abundant number, since it is smaller than the sum of its proper divisors (236745408155034).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200000001120102 is a wasteful number, since it uses less digits than its factorization.
200000001120102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 87489064492 (or 87489064489 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 200000001120102 its reverse (201021100000002), we get a palindrome (401021101120104).
The spelling of 200000001120102 in words is "two hundred trillion, one million, one hundred twenty thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.077 sec. • engine limits •