Base | Representation |
---|---|
bin | 10111110111110… |
… | …01001111001000 |
3 | 111221210202210020 |
4 | 23323321033020 |
5 | 402231002222 |
6 | 31512020440 |
7 | 4651046103 |
oct | 1373711710 |
9 | 457722706 |
10 | 200250312 |
11 | a3044029 |
12 | 57091720 |
13 | 32644212 |
14 | 1c84973a |
15 | 128a865c |
hex | bef93c8 |
200250312 has 64 divisors (see below), whose sum is σ = 520829760. Its totient is φ = 64108800.
The previous prime is 200250283. The next prime is 200250313. The reversal of 200250312 is 213052002.
It is a junction number, because it is equal to n+sod(n) for n = 200250291 and 200250300.
It is not an unprimeable number, because it can be changed into a prime (200250313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 61362 + ... + 64542.
It is an arithmetic number, because the mean of its divisors is an integer number (8137965).
Almost surely, 2200250312 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 200250312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (260414880).
200250312 is an abundant number, since it is smaller than the sum of its proper divisors (320579448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200250312 is a wasteful number, since it uses less digits than its factorization.
200250312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3294 (or 3290 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 15.
The square root of 200250312 is about 14150.9827220586. The cubic root of 200250312 is about 585.0474181740.
The spelling of 200250312 in words is "two hundred million, two hundred fifty thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •