Base | Representation |
---|---|
bin | 1001010000011111… |
… | …0000110111110000 |
3 | 20102012002021210000 |
4 | 2110013300313300 |
5 | 20042134010102 |
6 | 1050331310000 |
7 | 115403455035 |
oct | 22407606760 |
9 | 6365067700 |
10 | 2485063152 |
11 | 1065831800 |
12 | 5942ab300 |
13 | 307acc790 |
14 | 19808338c |
15 | e827a01c |
hex | 941f0df0 |
2485063152 has 600 divisors, whose sum is σ = 9051733152. Its totient is φ = 652354560.
The previous prime is 2485063127. The next prime is 2485063169. The reversal of 2485063152 is 2513605842.
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 119 ways as a sum of consecutive naturals, for example, 46887958 + ... + 46888010.
Almost surely, 22485063152 is an apocalyptic number.
2485063152 is a gapful number since it is divisible by the number (22) 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 2485063152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4525866576).
2485063152 is an abundant number, since it is smaller than the sum of its proper divisors (6566670000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2485063152 is a wasteful number, since it uses less digits than its factorization.
2485063152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131 (or 105 counting only the distinct ones).
The product of its (nonzero) digits is 57600, while the sum is 36.
The square root of 2485063152 is about 49850.4077415622. The cubic root of 2485063152 is about 1354.5004175817.
Adding to 2485063152 its reverse (2513605842), we get a palindrome (4998668994).
The spelling of 2485063152 in words is "two billion, four hundred eighty-five million, sixty-three thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.525 sec. • engine limits •