Base | Representation |
---|---|
bin | 10011011010011… |
… | …100100110100000 |
3 | 211200212021101222 |
4 | 103122130212200 |
5 | 1131334400000 |
6 | 52152514212 |
7 | 11033255453 |
oct | 2332344640 |
9 | 750767358 |
10 | 325700000 |
11 | 15793825a |
12 | 910ab968 |
13 | 526287c2 |
14 | 3138349a |
15 | 1d8d8a85 |
hex | 1369c9a0 |
325700000 has 72 divisors (see below), whose sum is σ = 801722124. Its totient is φ = 130240000.
The previous prime is 325699993. The next prime is 325700003. The reversal of 325700000 is 7523.
It can be written as a sum of positive squares in 6 ways, for example, as 7862416 + 317837584 = 2804^2 + 17828^2 .
It is not an unprimeable number, because it can be changed into a prime (325700003) 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 11 ways as a sum of consecutive naturals, for example, 98372 + ... + 101628.
Almost surely, 2325700000 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 325700000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (400861062).
325700000 is an abundant number, since it is smaller than the sum of its proper divisors (476022124).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
325700000 is an frugal number, since it uses more digits than its factorization.
325700000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3292 (or 3264 counting only the distinct ones).
The product of its (nonzero) digits is 210, while the sum is 17.
The square root of 325700000 is about 18047.1604414656. The cubic root of 325700000 is about 688.0276940357.
Adding to 325700000 its reverse (7523), we get a palindrome (325707523).
The spelling of 325700000 in words is "three hundred twenty-five million, seven hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •