Base | Representation |
---|---|
bin | 110000111101101110… |
… | …010100111100110000 |
3 | 12000201001102222000011 |
4 | 300331232110330300 |
5 | 1330133220142120 |
6 | 40052552104304 |
7 | 3540601335103 |
oct | 607556247460 |
9 | 160631388004 |
10 | 52575162160 |
11 | 2032a343544 |
12 | a233395094 |
13 | 4c5b427511 |
14 | 278a74873a |
15 | 157a9bac5a |
hex | c3db94f30 |
52575162160 has 80 divisors (see below), whose sum is σ = 123604097760. Its totient is φ = 20795443200.
The previous prime is 52575162109. The next prime is 52575162179. The reversal of 52575162160 is 6126157525.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (40).
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 15 ways as a sum of consecutive naturals, for example, 7130956 + ... + 7138324.
It is an arithmetic number, because the mean of its divisors is an integer number (1545051222).
Almost surely, 252575162160 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 52575162160, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (61802048880).
52575162160 is an abundant number, since it is smaller than the sum of its proper divisors (71028935600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52575162160 is a wasteful number, since it uses less digits than its factorization.
52575162160 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8366 (or 8360 counting only the distinct ones).
The product of its (nonzero) digits is 126000, while the sum is 40.
The spelling of 52575162160 in words is "fifty-two billion, five hundred seventy-five million, one hundred sixty-two thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •