Base | Representation |
---|---|
bin | 101110100000101001010011… |
… | …111001101000010000000100 |
3 | 222211021010101111221222110110 |
4 | 232200221103321220100010 |
5 | 203302401102113232200 |
6 | 2003014331223153020 |
7 | 61041334626212043 |
oct | 5640512371502004 |
9 | 884233344858413 |
10 | 204553520055300 |
11 | 5a1a472a410079 |
12 | 1ab37a13ba5770 |
13 | 8a1a411314050 |
14 | 387262c1b655a |
15 | 189ad8e591b50 |
hex | ba0a53e68404 |
204553520055300 has 144 divisors (see below), whose sum is σ = 637386047182080. Its totient is φ = 50350193295360.
The previous prime is 204553520055263. The next prime is 204553520055341. The reversal of 204553520055300 is 3550025355402.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (39).
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 47 ways as a sum of consecutive naturals, for example, 138726724 + ... + 140193476.
It is an arithmetic number, because the mean of its divisors is an integer number (4426291994320).
Almost surely, 2204553520055300 is an apocalyptic number.
204553520055300 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
204553520055300 is an abundant number, since it is smaller than the sum of its proper divisors (432832527126780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
204553520055300 is a wasteful number, since it uses less digits than its factorization.
204553520055300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1502542 (or 1502535 counting only the distinct ones).
The product of its (nonzero) digits is 450000, while the sum is 39.
The spelling of 204553520055300 in words is "two hundred four trillion, five hundred fifty-three billion, five hundred twenty million, fifty-five thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •