Base | Representation |
---|---|
bin | 10011010111110… |
… | …100101000100000 |
3 | 211122120022122111 |
4 | 103113310220200 |
5 | 1131200341000 |
6 | 52130045104 |
7 | 11024361565 |
oct | 2327645040 |
9 | 748508574 |
10 | 325012000 |
11 | 157508365 |
12 | 90a19794 |
13 | 524475c1 |
14 | 3124486c |
15 | 1d7eecba |
hex | 135f4a20 |
325012000 has 96 divisors (see below), whose sum is σ = 804598704. Its totient is φ = 129024000.
The previous prime is 325011989. The next prime is 325012007. The reversal of 325012000 is 210523.
It can be written as a sum of positive squares in 8 ways, for example, as 30958096 + 294053904 = 5564^2 + 17148^2 .
It is not an unprimeable number, because it can be changed into a prime (325012007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 771790 + ... + 772210.
Almost surely, 2325012000 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 325012000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (402299352).
325012000 is an abundant number, since it is smaller than the sum of its proper divisors (479586704).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
325012000 is a wasteful number, since it uses less digits than its factorization.
325012000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 639 (or 621 counting only the distinct ones).
The product of its (nonzero) digits is 60, while the sum is 13.
The square root of 325012000 is about 18028.0891943656. The cubic root of 325012000 is about 687.5428953952.
Adding to 325012000 its reverse (210523), we get a palindrome (325222523).
The spelling of 325012000 in words is "three hundred twenty-five million, twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •