Base | Representation |
---|---|
bin | 10011011011010… |
… | …110111011100000 |
3 | 211201022102010120 |
4 | 103123112323200 |
5 | 1131420021122 |
6 | 52202000240 |
7 | 11035302135 |
oct | 2333267340 |
9 | 751272116 |
10 | 325938912 |
11 | 157a90802 |
12 | 911a6080 |
13 | 526b0480 |
14 | 3140658c |
15 | 1d93475c |
hex | 136d6ee0 |
325938912 has 48 divisors (see below), whose sum is σ = 921407760. Its totient is φ = 100288512.
The previous prime is 325938887. The next prime is 325938931. The reversal of 325938912 is 219839523.
325938912 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a tau number, because it is divible by the number of its divisors (48).
It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 129337 + ... + 131832.
It is an arithmetic number, because the mean of its divisors is an integer number (19195995).
Almost surely, 2325938912 is an apocalyptic number.
325938912 is a gapful number since it is divisible by the number (32) formed by its first and last digit.
It is an amenable number.
325938912 is an abundant number, since it is smaller than the sum of its proper divisors (595468848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
325938912 is a wasteful number, since it uses less digits than its factorization.
325938912 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 261195 (or 261187 counting only the distinct ones).
The product of its digits is 116640, while the sum is 42.
The square root of 325938912 is about 18053.7783303108. The cubic root of 325938912 is about 688.1958834703.
The spelling of 325938912 in words is "three hundred twenty-five million, nine hundred thirty-eight thousand, nine hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •