Base | Representation |
---|---|
bin | 101000000101101… |
… | …001101111011100 |
3 | 1201212120010001022 |
4 | 220011221233130 |
5 | 2334134222312 |
6 | 150423303312 |
7 | 22444516310 |
oct | 5005515734 |
9 | 1655503038 |
10 | 672570332 |
11 | 315715055 |
12 | 1692aab38 |
13 | a9457315 |
14 | 65477b40 |
15 | 3e0a5172 |
hex | 28169bdc |
672570332 has 12 divisors (see below), whose sum is σ = 1345140720. Its totient is φ = 288244416.
The previous prime is 672570319. The next prime is 672570343. The reversal of 672570332 is 233075276.
672570332 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
672570332 is an admirable number.
It is a hoax number, since the sum of its digits (35) coincides with the sum of the digits of its distinct prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 672570292 and 672570301.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 12010157 + ... + 12010212.
It is an arithmetic number, because the mean of its divisors is an integer number (112095060).
Almost surely, 2672570332 is an apocalyptic number.
It is an amenable number.
672570332 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
672570332 is a wasteful number, since it uses less digits than its factorization.
672570332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24020380 (or 24020378 counting only the distinct ones).
The product of its (nonzero) digits is 52920, while the sum is 35.
The square root of 672570332 is about 25933.9609778375. The cubic root of 672570332 is about 876.1515535345.
The spelling of 672570332 in words is "six hundred seventy-two million, five hundred seventy thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •