Base | Representation |
---|---|
bin | 101000001111110… |
… | …001100011100000 |
3 | 1202001112220220000 |
4 | 220033301203200 |
5 | 2340324130101 |
6 | 151000220000 |
7 | 22506210303 |
oct | 5017614340 |
9 | 1661486800 |
10 | 675223776 |
11 | 317167687 |
12 | 16a16a600 |
13 | a9b75cc6 |
14 | 65968b3a |
15 | 3e42b486 |
hex | 283f18e0 |
675223776 has 120 divisors (see below), whose sum is σ = 2008812960. Its totient is φ = 222469632.
The previous prime is 675223771. The next prime is 675223837. The reversal of 675223776 is 677322576.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (675223771) 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 19 ways as a sum of consecutive naturals, for example, 229225 + ... + 232151.
It is an arithmetic number, because the mean of its divisors is an integer number (16740108).
Almost surely, 2675223776 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 675223776, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1004406480).
675223776 is an abundant number, since it is smaller than the sum of its proper divisors (1333589184).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
675223776 is a wasteful number, since it uses less digits than its factorization.
675223776 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3038 (or 3021 counting only the distinct ones).
The product of its digits is 740880, while the sum is 45.
The square root of 675223776 is about 25985.0683277916. The cubic root of 675223776 is about 877.3022477897.
The spelling of 675223776 in words is "six hundred seventy-five million, two hundred twenty-three thousand, seven hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •