Base | Representation |
---|---|
bin | 110000101101011100… |
… | …011010010111110000 |
3 | 12000000000111102120002 |
4 | 300231130122113300 |
5 | 1324103304432240 |
6 | 40005514005132 |
7 | 3531043631261 |
oct | 605534322760 |
9 | 160000442502 |
10 | 52302030320 |
11 | 201aa150551 |
12 | a177a167a8 |
13 | 4c16976047 |
14 | 276236a968 |
15 | 1561a17d15 |
hex | c2d71a5f0 |
52302030320 has 80 divisors (see below), whose sum is σ = 122198652000. Its totient is φ = 20818473984.
The previous prime is 52302030283. The next prime is 52302030349. The reversal of 52302030320 is 2303020325.
52302030320 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 (20).
It is a junction number, because it is equal to n+sod(n) for n = 52302030292 and 52302030301.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 15431186 + ... + 15434574.
It is an arithmetic number, because the mean of its divisors is an integer number (1527483150).
Almost surely, 252302030320 is an apocalyptic number.
It is an amenable number.
52302030320 is an abundant number, since it is smaller than the sum of its proper divisors (69896621680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
52302030320 is a wasteful number, since it uses less digits than its factorization.
52302030320 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4290 (or 4284 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 20.
Adding to 52302030320 its reverse (2303020325), we get a palindrome (54605050645).
The spelling of 52302030320 in words is "fifty-two billion, three hundred two million, thirty thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •