Base | Representation |
---|---|
bin | 10111111000101… |
… | …00010010110100 |
3 | 111222000101210222 |
4 | 23330110102310 |
5 | 402243024030 |
6 | 31514233512 |
7 | 4652020160 |
oct | 1374242264 |
9 | 458011728 |
10 | 200361140 |
11 | a310a321 |
12 | 57125898 |
13 | 326827b5 |
14 | 1c877ca0 |
15 | 128cb3e5 |
hex | bf144b4 |
200361140 has 48 divisors (see below), whose sum is σ = 482732544. Its totient is φ = 68428800.
The previous prime is 200361107. The next prime is 200361151. The reversal of 200361140 is 41163002.
200361140 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 35300 + ... + 40580.
It is an arithmetic number, because the mean of its divisors is an integer number (10056928).
Almost surely, 2200361140 is an apocalyptic number.
200361140 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 200361140, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (241366272).
200361140 is an abundant number, since it is smaller than the sum of its proper divisors (282371404).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200361140 is a wasteful number, since it uses less digits than its factorization.
200361140 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5568 (or 5566 counting only the distinct ones).
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 200361140 is about 14154.8980921800. The cubic root of 200361140 is about 585.1553292454.
The spelling of 200361140 in words is "two hundred million, three hundred sixty-one thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •