Base | Representation |
---|---|
bin | 10111110110101… |
… | …01010011100000 |
3 | 111221112021220021 |
4 | 23323111103200 |
5 | 402211300021 |
6 | 31504523224 |
7 | 4646564032 |
oct | 1373252340 |
9 | 457467807 |
10 | 200103136 |
11 | a2a534a2 |
12 | 57020514 |
13 | 325c222c |
14 | 1c80bc52 |
15 | 12879c41 |
hex | bed54e0 |
200103136 has 48 divisors (see below), whose sum is σ = 416178000. Its totient is φ = 94445568.
The previous prime is 200103133. The next prime is 200103157. The reversal of 200103136 is 631301002.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200103133) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 272626 + ... + 273358.
It is an arithmetic number, because the mean of its divisors is an integer number (8670375).
Almost surely, 2200103136 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 200103136, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (208089000).
200103136 is an abundant number, since it is smaller than the sum of its proper divisors (216074864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200103136 is a wasteful number, since it uses less digits than its factorization.
200103136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1211 (or 1203 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 16.
The square root of 200103136 is about 14145.7815620064. The cubic root of 200103136 is about 584.9040541993.
Adding to 200103136 its reverse (631301002), we get a palindrome (831404138).
The spelling of 200103136 in words is "two hundred million, one hundred three thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •