Search a number
-
+
200110110000000 = 2735722932909
BaseRepresentation
bin101101011111111111000100…
…000001011100001110000000
3222020112100011122000121120120
4231133333010001130032000
5202212101001130000000
61545333152044540240
760102323034006624
oct5537770401341600
9866470148017516
10200110110000000
1158841248265052
121a53a81ab51680
1387873c14c1135
14375b54967d184
1518204cab646a0
hexb5ffc405c380

200110110000000 has 512 divisors, whose sum is σ = 664944664924800. Its totient is φ = 53321088000000.

The previous prime is 200110109999897. The next prime is 200110110000007. The reversal of 200110110000000 is 11011002.

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

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

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

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 not an unprimeable number, because it can be changed into a prime (200110110000007) 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 63 ways as a sum of consecutive naturals, for example, 68789998546 + ... + 68790001454.

Almost surely, 2200110110000000 is an apocalyptic number.

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

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

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

200110110000000 is an frugal number, since it uses more digits than its factorization.

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

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

The product of its (nonzero) digits is 2, while the sum is 6.

Adding to 200110110000000 its reverse (11011002), we get a palindrome (200110121011002).

The spelling of 200110110000000 in words is "two hundred trillion, one hundred ten billion, one hundred ten million", and thus it is an aban number.