Search a number
-
+
200231110000 = 2454169311827
BaseRepresentation
bin1011101001111010110…
…1000100010101110000
3201010211110011021211001
42322132231010111300
511240033131010000
6231552423331344
720315625232045
oct2723655042560
9633743137731
10200231110000
1177a102725a9
1232980bb0b54
1315b6017975c
149996a811cc
15531d8c646a
hex2e9eb44570

200231110000 has 100 divisors (see below), whose sum is σ = 485106897352. Its totient is φ = 80038368000.

The previous prime is 200231109973. The next prime is 200231110003. The reversal of 200231110000 is 11132002.

200231110000 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a tau number, because it is divible by the number of its divisors (100).

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

It is a congruent number.

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

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

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

Almost surely, 2200231110000 is an apocalyptic number.

200231110000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 200231110000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (242553448676).

200231110000 is an abundant number, since it is smaller than the sum of its proper divisors (284875787352).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

The product of its (nonzero) digits is 12, while the sum is 10.

Adding to 200231110000 its reverse (11132002), we get a palindrome (200242242002).

The spelling of 200231110000 in words is "two hundred billion, two hundred thirty-one million, one hundred ten thousand".

Divisors: 1 2 4 5 8 10 16 20 25 40 50 80 100 125 200 250 400 500 625 1000 1250 1693 2000 2500 3386 5000 6772 8465 10000 11827 13544 16930 23654 27088 33860 42325 47308 59135 67720 84650 94616 118270 135440 169300 189232 211625 236540 295675 338600 423250 473080 591350 677200 846500 946160 1058125 1182700 1478375 1693000 2116250 2365400 2956750 3386000 4232500 4730800 5913500 7391875 8465000 11827000 14783750 16930000 20023111 23654000 29567500 40046222 59135000 80092444 100115555 118270000 160184888 200231110 320369776 400462220 500577775 800924440 1001155550 1601848880 2002311100 2502888875 4004622200 5005777750 8009244400 10011555500 12514444375 20023111000 25028888750 40046222000 50057777500 100115555000 200231110000