Base | Representation |
---|---|
bin | 10100001010111100000 |
3 | 1020120200000 |
4 | 2201113200 |
5 | 132122320 |
6 | 22100000 |
7 | 5421666 |
oct | 2412740 |
9 | 1216600 |
10 | 660960 |
11 | 411653 |
12 | 27a600 |
13 | 1a1b01 |
14 | 132c36 |
15 | d0c90 |
hex | a15e0 |
660960 has 144 divisors (see below), whose sum is σ = 2476656. Its totient is φ = 165888.
The previous prime is 660949. The next prime is 660973. The reversal of 660960 is 69066.
It is a tau number, because it is divible by the number of its divisors (144).
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a nialpdrome in base 6.
It is a congruent number.
It is an unprimeable number.
660960 is an untouchable number, because it is not equal to the sum of proper divisors of any number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 38872 + ... + 38888.
It is an arithmetic number, because the mean of its divisors is an integer number (17199).
2660960 is an apocalyptic number.
660960 is a gapful number since it is divisible by the number (60) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 660960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1238328).
660960 is an abundant number, since it is smaller than the sum of its proper divisors (1815696).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
660960 is a wasteful number, since it uses less digits than its factorization.
660960 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 47 (or 27 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 27.
The square root of 660960 is about 812.9944649258. The cubic root of 660960 is about 87.1080702195.
The spelling of 660960 in words is "six hundred sixty thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •