| Base | Representation |
|---|---|
| bin | 1011101001011011110… |
| … | …0110001101001010000 |
| 3 | 201010111101100112011112 |
| 4 | 2322112330301221100 |
| 5 | 11234301324310000 |
| 6 | 231531455032452 |
| 7 | 20312455343543 |
| oct | 2722674615120 |
| 9 | 633441315145 |
| 10 | 200101010000 |
| 11 | 77953892541 |
| 12 | 3294550b728 |
| 13 | 15b3c2275c8 |
| 14 | 998369685a |
| 15 | 5312278235 |
| hex | 2e96f31a50 |
200101010000 has 100 divisors (see below), whose sum is σ = 484956014400. Its totient is φ = 79959216000.
The previous prime is 200101009993. The next prime is 200101010003. The reversal of 200101010000 is 10101002.
It is a happy number.
200101010000 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 (5).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200101010003) 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, 10380371 + ... + 10399629.
It is an arithmetic number, because the mean of its divisors is an integer number (4849560144).
Almost surely, 2200101010000 is an apocalyptic number.
200101010000 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 200101010000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (242478007200).
200101010000 is an abundant number, since it is smaller than the sum of its proper divisors (284855004400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200101010000 is a wasteful number, since it uses less digits than its factorization.
200101010000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20326 (or 20305 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 5.
Adding to 200101010000 its reverse (10101002), we get a palindrome (200111111002).
The spelling of 200101010000 in words is "two hundred billion, one hundred one million, ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •