Base | Representation |
---|---|
bin | 101000001111101… |
… | …000110101011100 |
3 | 1202001111002220012 |
4 | 220033220311130 |
5 | 2340322004220 |
6 | 150555342352 |
7 | 22506001211 |
oct | 5017506534 |
9 | 1661432805 |
10 | 675188060 |
11 | 317142868 |
12 | 16a1519b8 |
13 | a9b62981 |
14 | 65959b08 |
15 | 3e420ac5 |
hex | 283e8d5c |
675188060 has 48 divisors (see below), whose sum is σ = 1474502400. Its totient is φ = 259422720.
The previous prime is 675188053. The next prime is 675188071. The reversal of 675188060 is 60881576.
675188060 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 675187999 and 675188017.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 80966 + ... + 88914.
It is an arithmetic number, because the mean of its divisors is an integer number (30718800).
Almost surely, 2675188060 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 675188060, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (737251200).
675188060 is an abundant number, since it is smaller than the sum of its proper divisors (799314340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
675188060 is a wasteful number, since it uses less digits than its factorization.
675188060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8126 (or 8124 counting only the distinct ones).
The product of its (nonzero) digits is 80640, while the sum is 41.
The square root of 675188060 is about 25984.3810778706. The cubic root of 675188060 is about 877.2867791995.
The spelling of 675188060 in words is "six hundred seventy-five million, one hundred eighty-eight thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •