Base | Representation |
---|---|
bin | 10111110110010… |
… | …11000110100111 |
3 | 111221110011120200 |
4 | 23323023012213 |
5 | 402203430401 |
6 | 31504001543 |
7 | 4646331150 |
oct | 1373130647 |
9 | 457404520 |
10 | 200061351 |
11 | a2a25066 |
12 | 570002b3 |
13 | 325a91c9 |
14 | 1c7da927 |
15 | 1286c686 |
hex | becb1a7 |
200061351 has 12 divisors (see below), whose sum is σ = 330260112. Its totient is φ = 114320736.
The previous prime is 200061349. The next prime is 200061353. The reversal of 200061351 is 153160002.
200061351 is a `hidden beast` number, since 2 + 0 + 0 + 0 + 613 + 51 = 666.
It is an interprime number because it is at equal distance from previous prime (200061349) and next prime (200061353).
It is not a de Polignac number, because 200061351 - 21 = 200061349 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200061353) 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 11 ways as a sum of consecutive naturals, for example, 1587726 + ... + 1587851.
It is an arithmetic number, because the mean of its divisors is an integer number (27521676).
Almost surely, 2200061351 is an apocalyptic number.
200061351 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
200061351 is a deficient number, since it is larger than the sum of its proper divisors (130198761).
200061351 is a wasteful number, since it uses less digits than its factorization.
200061351 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3175590 (or 3175587 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 18.
The square root of 200061351 is about 14144.3045428186. The cubic root of 200061351 is about 584.8633386667.
The spelling of 200061351 in words is "two hundred million, sixty-one thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •