Base | Representation |
---|---|
bin | 10111110111011… |
… | …10110010110100 |
3 | 111221201121010002 |
4 | 23323232302310 |
5 | 402223120130 |
6 | 31511050432 |
7 | 4650510311 |
oct | 1373566264 |
9 | 457647102 |
10 | 200207540 |
11 | a3014985 |
12 | 57070a18 |
13 | 3262a900 |
14 | 1c837d08 |
15 | 1289ab45 |
hex | beeecb4 |
200207540 has 36 divisors (see below), whose sum is σ = 455272524. Its totient is φ = 73921536.
The previous prime is 200207533. The next prime is 200207543. The reversal of 200207540 is 45702002.
It can be written as a sum of positive squares in 6 ways, for example, as 68095504 + 132112036 = 8252^2 + 11494^2 .
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200207543) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 26237 + ... + 32996.
It is an arithmetic number, because the mean of its divisors is an integer number (12646459).
Almost surely, 2200207540 is an apocalyptic number.
200207540 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
200207540 is an abundant number, since it is smaller than the sum of its proper divisors (255064984).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200207540 is a wasteful number, since it uses less digits than its factorization.
200207540 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 59268 (or 59253 counting only the distinct ones).
The product of its (nonzero) digits is 560, while the sum is 20.
The square root of 200207540 is about 14149.4713682173. The cubic root of 200207540 is about 585.0057612601.
Adding to 200207540 its reverse (45702002), we get a palindrome (245909542).
The spelling of 200207540 in words is "two hundred million, two hundred seven thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •