Base | Representation |
---|---|
bin | 110001001110010… |
… | …011010111001100 |
3 | 2010112221122210000 |
4 | 301032103113030 |
5 | 3142403123113 |
6 | 213540244300 |
7 | 26315315055 |
oct | 6116232714 |
9 | 2115848700 |
10 | 825832908 |
11 | 39418553a |
12 | 1b06a0690 |
13 | 102129234 |
14 | 7b97172c |
15 | 4c77b373 |
hex | 313935cc |
825832908 has 60 divisors (see below), whose sum is σ = 2175482232. Its totient is φ = 273162240.
The previous prime is 825832907. The next prime is 825832927. The reversal of 825832908 is 809238528.
825832908 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (825832907) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 32716 + ... + 52172.
Almost surely, 2825832908 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 825832908, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1087741116).
825832908 is an abundant number, since it is smaller than the sum of its proper divisors (1349649324).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
825832908 is a wasteful number, since it uses less digits than its factorization.
825832908 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19604 (or 19593 counting only the distinct ones).
The product of its (nonzero) digits is 276480, while the sum is 45.
The square root of 825832908 is about 28737.3086422511. The cubic root of 825832908 is about 938.2042477982.
It can be divided in two parts, 82583 and 2908, that added together give a triangular number (85491 = T413).
The spelling of 825832908 in words is "eight hundred twenty-five million, eight hundred thirty-two thousand, nine hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •