Base | Representation |
---|---|
bin | 10011011000010… |
… | …110100101011000 |
3 | 211122211101102000 |
4 | 103120112211120 |
5 | 1131214313224 |
6 | 52133041000 |
7 | 11025511200 |
oct | 2330264530 |
9 | 748741360 |
10 | 325151064 |
11 | 1575a2897 |
12 | 90a86160 |
13 | 524959a4 |
14 | 3127d400 |
15 | 1d82b0c9 |
hex | 13616958 |
325151064 has 192 divisors, whose sum is σ = 1085644800. Its totient is φ = 89812800.
The previous prime is 325151063. The next prime is 325151093. The reversal of 325151064 is 460151523.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (325151063) 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 47 ways as a sum of consecutive naturals, for example, 327609 + ... + 328599.
It is an arithmetic number, because the mean of its divisors is an integer number (5654400).
Almost surely, 2325151064 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 325151064, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (542822400).
325151064 is an abundant number, since it is smaller than the sum of its proper divisors (760493736).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
325151064 is a wasteful number, since it uses less digits than its factorization.
325151064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1051 (or 1034 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
The square root of 325151064 is about 18031.9456520920. The cubic root of 325151064 is about 687.6409418589.
The spelling of 325151064 in words is "three hundred twenty-five million, one hundred fifty-one thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •