Search a number
-
+
200955345251 = 1511913695677
BaseRepresentation
bin1011101100100111011…
…1110011100101100011
3201012200220221020210212
42323021313303211203
511243024032022001
6232152334244335
720342601152063
oct2731167634543
9635626836725
10200955345251
1178252065231
1232b436566ab
1315c47222c1b
149a24d273a3
1553622847bb
hex2ec9df3963

200955345251 has 8 divisors (see below), whose sum is σ = 202392209184. Its totient is φ = 199519876800.

The previous prime is 200955345233. The next prime is 200955345257. The reversal of 200955345251 is 152543559002.

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 200955345251 - 26 = 200955345187 is a prime.

It is a Duffinian number.

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

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 58976 + ... + 636701.

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

Almost surely, 2200955345251 is an apocalyptic number.

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

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

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

The sum of its prime factors is 697741.

The product of its (nonzero) digits is 270000, while the sum is 41.

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

Divisors: 1 151 1913 288863 695677 105047227 1330830101 200955345251