Base | Representation |
---|---|
bin | 110001001100000… |
… | …101001011000100 |
3 | 2010111212001212100 |
4 | 301030011023010 |
5 | 3142231004000 |
6 | 213515552100 |
7 | 26310341064 |
oct | 6114051304 |
9 | 2114761770 |
10 | 825250500 |
11 | 393917a08 |
12 | 1b045b630 |
13 | 101c84109 |
14 | 7b85d3a4 |
15 | 4c6b3a00 |
hex | 313052c4 |
825250500 has 72 divisors (see below), whose sum is σ = 2603404440. Its totient is φ = 220065600.
The previous prime is 825250493. The next prime is 825250507. The reversal of 825250500 is 5052528.
It is an interprime number because it is at equal distance from previous prime (825250493) and next prime (825250507).
It can be written as a sum of positive squares in 4 ways, for example, as 125753796 + 699496704 = 11214^2 + 26448^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (825250507) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 87195 + ... + 96194.
It is an arithmetic number, because the mean of its divisors is an integer number (36158395).
Almost surely, 2825250500 is an apocalyptic number.
It is an amenable number.
825250500 is an abundant number, since it is smaller than the sum of its proper divisors (1778153940).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
825250500 is a wasteful number, since it uses less digits than its factorization.
825250500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 183414 (or 183399 counting only the distinct ones).
The product of its (nonzero) digits is 4000, while the sum is 27.
The square root of 825250500 is about 28727.1735470095. The cubic root of 825250500 is about 937.9836437850.
The spelling of 825250500 in words is "eight hundred twenty-five million, two hundred fifty thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •