Base | Representation |
---|---|
bin | 10111111001101… |
… | …11001100101001 |
3 | 111222021122220222 |
4 | 23330313030221 |
5 | 402312112410 |
6 | 31521255425 |
7 | 4653154034 |
oct | 1374671451 |
9 | 458248828 |
10 | 200504105 |
11 | a31a777a |
12 | 57194575 |
13 | 327028a9 |
14 | 1c8b401b |
15 | 12908955 |
hex | bf37329 |
200504105 has 8 divisors (see below), whose sum is σ = 240682752. Its totient is φ = 160351408.
The previous prime is 200504077. The next prime is 200504107. The reversal of 200504105 is 501405002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 200504105 - 222 = 196309801 is a prime.
It is a super-2 number, since 2×2005041052 = 80403792243702050, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (200504107) 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 7 ways as a sum of consecutive naturals, for example, 21494 + ... + 29376.
It is an arithmetic number, because the mean of its divisors is an integer number (30085344).
Almost surely, 2200504105 is an apocalyptic number.
It is an amenable number.
200504105 is a deficient number, since it is larger than the sum of its proper divisors (40178647).
200504105 is an equidigital number, since it uses as much as digits as its factorization.
200504105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12975.
The product of its (nonzero) digits is 200, while the sum is 17.
The square root of 200504105 is about 14159.9472103536. The cubic root of 200504105 is about 585.2944727310.
Adding to 200504105 its reverse (501405002), we get a palindrome (701909107).
The spelling of 200504105 in words is "two hundred million, five hundred four thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •