Search a number
-
+
200265473635 = 5130730645061
BaseRepresentation
bin1011101010000011000…
…0001001111001100011
3201010220211211010212021
42322200300021321203
511240120430124020
6232000052042311
720316523303423
oct2724060117143
9633824733767
10200265473635
1177a287034a7
1232990603397
1315b6731b976
14999b468483
1553219131aa
hex2ea0c09e63

200265473635 has 8 divisors (see below), whose sum is σ = 240502446576. Its totient is φ = 160089793440.

The previous prime is 200265473633. The next prime is 200265473657. The reversal of 200265473635 is 536374562002.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 200265473635 - 21 = 200265473633 is a prime.

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

It is a Duffinian number.

It is a junction number, because it is equal to n+sod(n) for n = 200265473591 and 200265473600.

It is not an unprimeable number, because it can be changed into a prime (200265473633) 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, 15315996 + ... + 15329065.

It is an arithmetic number, because the mean of its divisors is an integer number (30062805822).

Almost surely, 2200265473635 is an apocalyptic number.

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

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

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

The sum of its prime factors is 30646373.

The product of its (nonzero) digits is 907200, while the sum is 43.

The spelling of 200265473635 in words is "two hundred billion, two hundred sixty-five million, four hundred seventy-three thousand, six hundred thirty-five".

Divisors: 1 5 1307 6535 30645061 153225305 40053094727 200265473635