Search a number
-
+
200030103000 = 2332537213233741
BaseRepresentation
bin1011101001001010111…
…0010010010111011000
3201010022102221002001100
42322102232102113120
511234130201244000
6231520443151400
720310634551600
oct2722256222730
9633272832040
10200030103000
1177917862012
1232925815560
1315b2a62bcc0
1499780b9c00
15530ae1da00
hex2e92b925d8

200030103000 has 2304 divisors, whose sum is σ = 929835728640. Its totient is φ = 38320128000.

The previous prime is 200030102989. The next prime is 200030103017. The reversal of 200030103000 is 301030002.

It is a happy number.

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

It is a super-3 number, since 3×2000301030003 (a number of 35 digits) contains 333 as substring.

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

It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.

It is a congruent number.

It is an unprimeable number.

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 575 ways as a sum of consecutive naturals, for example, 4878782980 + ... + 4878783020.

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

Almost surely, 2200030103000 is an apocalyptic number.

200030103000 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 200030103000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (464917864320).

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

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

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

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

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

The product of its (nonzero) digits is 18, while the sum is 9.

Adding to 200030103000 its reverse (301030002), we get a palindrome (200331133002).

The spelling of 200030103000 in words is "two hundred billion, thirty million, one hundred three thousand".