Base | Representation |
---|---|
bin | 1001110001010010… |
… | …10000000101000000 |
3 | 111112112222002222012 |
4 | 10320221100011000 |
5 | 41220244231102 |
6 | 2224253032052 |
7 | 243661233563 |
oct | 47051200500 |
9 | 14475862865 |
10 | 5245305152 |
11 | 225192443a |
12 | 1024785628 |
13 | 657919379 |
14 | 37a8b84da |
15 | 20a75e752 |
hex | 138a50140 |
5245305152 has 56 divisors (see below), whose sum is σ = 11006644992. Its totient is φ = 2476108800.
The previous prime is 5245305119. The next prime is 5245305161. The reversal of 5245305152 is 2515035425.
It is a super-2 number, since 2×52453051522 = 55026452275195486208, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 49103 + ... + 113585.
It is an arithmetic number, because the mean of its divisors is an integer number (196547232).
Almost surely, 25245305152 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 5245305152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (5503322496).
5245305152 is an abundant number, since it is smaller than the sum of its proper divisors (5761339840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5245305152 is a wasteful number, since it uses less digits than its factorization.
5245305152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 64567 (or 64557 counting only the distinct ones).
The product of its (nonzero) digits is 30000, while the sum is 32.
The square root of 5245305152 is about 72424.4789556680. The cubic root of 5245305152 is about 1737.4950912133.
The spelling of 5245305152 in words is "five billion, two hundred forty-five million, three hundred five thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •