Base | Representation |
---|---|
bin | 1001101110010011… |
… | …01010010000000000 |
3 | 111110210211000000000 |
4 | 10313021222100000 |
5 | 41142340342103 |
6 | 2222000000000 |
7 | 243235235430 |
oct | 46711522000 |
9 | 14423730000 |
10 | 5220246528 |
11 | 2239769532 |
12 | 1018300000 |
13 | 652684593 |
14 | 3774342c0 |
15 | 20845eaa3 |
hex | 13726a400 |
5220246528 has 440 divisors, whose sum is σ = 18372430912. Its totient is φ = 1451188224.
The previous prime is 5220246469. The next prime is 5220246547. The reversal of 5220246528 is 8256420225.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a nialpdrome in base 6.
It is a zygodrome in base 6.
It is a junction number, because it is equal to n+sod(n) for n = 5220246492 and 5220246501.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 141087726 + ... + 141087762.
Almost surely, 25220246528 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 5220246528, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9186215456).
5220246528 is an abundant number, since it is smaller than the sum of its proper divisors (13152184384).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5220246528 is an frugal number, since it uses more digits than its factorization.
5220246528 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 91 (or 49 counting only the distinct ones).
The product of its (nonzero) digits is 76800, while the sum is 36.
The square root of 5220246528 is about 72251.2735389488. The cubic root of 5220246528 is about 1734.7238031442.
The spelling of 5220246528 in words is "five billion, two hundred twenty million, two hundred forty-six thousand, five hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •