Base | Representation |
---|---|
bin | 1011111001000111101… |
… | …1011110010111010100 |
3 | 201112100211121021200120 |
4 | 2332101323132113110 |
5 | 11321412302000400 |
6 | 233505353511540 |
7 | 20522015136003 |
oct | 2762173362724 |
9 | 645324537616 |
10 | 204311750100 |
11 | 79714724937 |
12 | 3371b7125b0 |
13 | 163606c39b3 |
14 | 9c629c6c3a |
15 | 54abc79ca0 |
hex | 2f91ede5d4 |
204311750100 has 144 divisors (see below), whose sum is σ = 593285360640. Its totient is φ = 54286041600.
The previous prime is 204311750099. The next prime is 204311750113. The reversal of 204311750100 is 1057113402.
It is a congruent number.
It is an unprimeable number.
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 47 ways as a sum of consecutive naturals, for example, 138892365 + ... + 138893835.
Almost surely, 2204311750100 is an apocalyptic number.
204311750100 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 204311750100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (296642680320).
204311750100 is an abundant number, since it is smaller than the sum of its proper divisors (388973610540).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
204311750100 is a wasteful number, since it uses less digits than its factorization.
204311750100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2850 (or 2843 counting only the distinct ones).
The product of its (nonzero) digits is 840, while the sum is 24.
Adding to 204311750100 its reverse (1057113402), we get a palindrome (205368863502).
The spelling of 204311750100 in words is "two hundred four billion, three hundred eleven million, seven hundred fifty thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •