Base | Representation |
---|---|
bin | 11001001110001100111000… |
… | …01101111101110111001000 |
3 | 21021101021002000112001111120 |
4 | 30213012130031331313020 |
5 | 24232203304100201300 |
6 | 313543332351355240 |
7 | 14453052031653345 |
oct | 1447063415756710 |
9 | 237337060461446 |
10 | 55463533600200 |
11 | 16743a52871150 |
12 | 6279255222b20 |
13 | 24c425b98493b |
14 | d9a64102d7cc |
15 | 662b018253a0 |
hex | 32719c37ddc8 |
55463533600200 has 384 divisors, whose sum is σ = 193905283017600. Its totient is φ = 12997407744000.
The previous prime is 55463533600183. The next prime is 55463533600213. The reversal of 55463533600200 is 200633536455.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 28555194 + ... + 30435606.
It is an arithmetic number, because the mean of its divisors is an integer number (504961674525).
Almost surely, 255463533600200 is an apocalyptic number.
55463533600200 is a gapful number since it is divisible by the number (50) 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 55463533600200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (96952641508800).
55463533600200 is an abundant number, since it is smaller than the sum of its proper divisors (138441749417400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55463533600200 is a wasteful number, since it uses less digits than its factorization.
55463533600200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1880593 (or 1880584 counting only the distinct ones).
The product of its (nonzero) digits is 972000, while the sum is 42.
The spelling of 55463533600200 in words is "fifty-five trillion, four hundred sixty-three billion, five hundred thirty-three million, six hundred thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •