Base | Representation |
---|---|
bin | 110000111000000110… |
… | …110011011100000000 |
3 | 12000110111002201111000 |
4 | 300320012303130000 |
5 | 1324440103241300 |
6 | 40035344052000 |
7 | 3535345263450 |
oct | 607006633400 |
9 | 160414081430 |
10 | 52480915200 |
11 | 2029112139a |
12 | a207904000 |
13 | 4c44a4949c |
14 | 277c013d60 |
15 | 15725a0c00 |
hex | c381b3700 |
52480915200 has 864 divisors, whose sum is σ = 225271692800. Its totient is φ = 11705057280.
The previous prime is 52480915171. The next prime is 52480915241. The reversal of 52480915200 is 251908425.
52480915200 is a `hidden beast` number, since 5 + 2 + 48 + 0 + 91 + 520 + 0 = 666.
It is a tau number, because it is divible by the number of its divisors (864).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
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, 52012296 + ... + 52013304.
Almost surely, 252480915200 is an apocalyptic number.
52480915200 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 52480915200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (112635846400).
52480915200 is an abundant number, since it is smaller than the sum of its proper divisors (172790777600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52480915200 is a wasteful number, since it uses less digits than its factorization.
52480915200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1094 (or 1069 counting only the distinct ones).
The product of its (nonzero) digits is 28800, while the sum is 36.
The spelling of 52480915200 in words is "fifty-two billion, four hundred eighty million, nine hundred fifteen thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •