Base | Representation |
---|---|
bin | 10011011000000… |
… | …001010110000110 |
3 | 211122122222002000 |
4 | 103120001112012 |
5 | 1131204022240 |
6 | 52131130130 |
7 | 11024666442 |
oct | 2330012606 |
9 | 748588060 |
10 | 325064070 |
11 | 1575434a1 |
12 | 90a43946 |
13 | 52465206 |
14 | 31259822 |
15 | 1d810430 |
hex | 13601586 |
325064070 has 32 divisors (see below), whose sum is σ = 866838240. Its totient is φ = 86683680.
The previous prime is 325064041. The next prime is 325064071. The reversal of 325064070 is 70460523.
It is a happy number.
325064070 is a `hidden beast` number, since 3 + 250 + 6 + 407 + 0 = 666.
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 (325064071) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 601701 + ... + 602240.
It is an arithmetic number, because the mean of its divisors is an integer number (27088695).
Almost surely, 2325064070 is an apocalyptic number.
325064070 is a gapful number since it is divisible by the number (30) formed by its first and last digit.
325064070 is an abundant number, since it is smaller than the sum of its proper divisors (541774170).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
325064070 is a wasteful number, since it uses less digits than its factorization.
325064070 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1203957 (or 1203951 counting only the distinct ones).
The product of its (nonzero) digits is 5040, while the sum is 27.
The square root of 325064070 is about 18029.5332718293. The cubic root of 325064070 is about 687.5796103953.
The spelling of 325064070 in words is "three hundred twenty-five million, sixty-four thousand, seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •