Base | Representation |
---|---|
bin | 100111011011111… |
… | …001100111100000 |
3 | 1201002222001022012 |
4 | 213123321213200 |
5 | 2323334002222 |
6 | 145352532052 |
7 | 22252502525 |
oct | 4733714740 |
9 | 1632861265 |
10 | 661625312 |
11 | 30a519987 |
12 | 1656b1028 |
13 | a70c458a |
14 | 63c2914c |
15 | 3d1421e2 |
hex | 276f99e0 |
661625312 has 48 divisors (see below), whose sum is σ = 1423723392. Its totient is φ = 301301760.
The previous prime is 661625311. The next prime is 661625317. The reversal of 661625312 is 213526166.
It is a Harshad number since it is a multiple of its sum of digits (32).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (661625311) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 2753 + ... + 36480.
It is an arithmetic number, because the mean of its divisors is an integer number (29660904).
Almost surely, 2661625312 is an apocalyptic number.
661625312 is a gapful number since it is divisible by the number (62) formed by its first and last digit.
It is an amenable number.
661625312 is an abundant number, since it is smaller than the sum of its proper divisors (762098080).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
661625312 is a wasteful number, since it uses less digits than its factorization.
661625312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 39291 (or 39283 counting only the distinct ones).
The product of its digits is 12960, while the sum is 32.
The square root of 661625312 is about 25722.0782986134. The cubic root of 661625312 is about 871.3728762552.
The spelling of 661625312 in words is "six hundred sixty-one million, six hundred twenty-five thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •