Base | Representation |
---|---|
bin | 10011011010010… |
… | …110101011111010 |
3 | 211200211001011120 |
4 | 103122112223322 |
5 | 1131333111040 |
6 | 52152210110 |
7 | 11033125020 |
oct | 2332265372 |
9 | 750731146 |
10 | 325675770 |
11 | 157921032 |
12 | 91099936 |
13 | 5261a774 |
14 | 31378710 |
15 | 1d8d17d0 |
hex | 13696afa |
325675770 has 128 divisors (see below), whose sum is σ = 970997760. Its totient is φ = 68221440.
The previous prime is 325675769. The next prime is 325675781. The reversal of 325675770 is 77576523.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 122374 + ... + 125006.
It is an arithmetic number, because the mean of its divisors is an integer number (7585920).
Almost surely, 2325675770 is an apocalyptic number.
325675770 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 325675770, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (485498880).
325675770 is an abundant number, since it is smaller than the sum of its proper divisors (645321990).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
325675770 is a wasteful number, since it uses less digits than its factorization.
325675770 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2700.
The product of its (nonzero) digits is 308700, while the sum is 42.
The square root of 325675770 is about 18046.4891322384. The cubic root of 325675770 is about 688.0106319905.
The spelling of 325675770 in words is "three hundred twenty-five million, six hundred seventy-five thousand, seven hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •