Search a number
-
+
200010521943 = 3415116352753
BaseRepresentation
bin1011101001000110001…
…1100101110101010111
3201010021002002020220000
42322101203211311113
511234110143200233
6231514503342343
720310306246141
oct2722143456527
9633232066800
10200010521943
11779077a8521
123291b1519b3
1315b2656448b
14997565dc91
155309351d13
hex2e918e5d57

200010521943 has 20 divisors (see below), whose sum is σ = 300759851568. Its totient is φ = 132457291200.

The previous prime is 200010521917. The next prime is 200010521959. The reversal of 200010521943 is 349125010002.

It is not a de Polignac number, because 200010521943 - 25 = 200010521911 is a prime.

It is a super-2 number, since 2×2000105219432 (a number of 23 digits) contains 22 as substring.

It is a Harshad number since it is a multiple of its sum of digits (27).

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (200010521983) by changing a digit.

It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 8164146 + ... + 8188607.

Almost surely, 2200010521943 is an apocalyptic number.

200010521943 is a deficient number, since it is larger than the sum of its proper divisors (100749329625).

200010521943 is a wasteful number, since it uses less digits than its factorization.

200010521943 is an odious number, because the sum of its binary digits is odd.

The sum of its prime factors is 16352916 (or 16352907 counting only the distinct ones).

The product of its (nonzero) digits is 2160, while the sum is 27.

Adding to 200010521943 its reverse (349125010002), we get a palindrome (549135531945).

The spelling of 200010521943 in words is "two hundred billion, ten million, five hundred twenty-one thousand, nine hundred forty-three".

Divisors: 1 3 9 27 81 151 453 1359 4077 12231 16352753 49058259 147174777 441524331 1324572993 2469265703 7407797109 22223391327 66670173981 200010521943