Base | Representation |
---|---|
bin | 1100101101110… |
… | …00000110100100 |
3 | 21102200220101000 |
4 | 12112320012210 |
5 | 204301112020 |
6 | 14330033300 |
7 | 2433411600 |
oct | 626700644 |
9 | 242626330 |
10 | 106660260 |
11 | 55230483 |
12 | 2b878830 |
13 | 191361a5 |
14 | 10246500 |
15 | 956d090 |
hex | 65b81a4 |
106660260 has 288 divisors, whose sum is σ = 402192000. Its totient is φ = 23369472.
The previous prime is 106660217. The next prime is 106660271. The reversal of 106660260 is 62066601.
It is a super-2 number, since 2×1066602602 = 22752822126535200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 767271 + ... + 767409.
It is an arithmetic number, because the mean of its divisors is an integer number (1396500).
Almost surely, 2106660260 is an apocalyptic number.
106660260 is a gapful number since it is divisible by the number (10) 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 106660260, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (201096000).
106660260 is an abundant number, since it is smaller than the sum of its proper divisors (295531740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106660260 is a wasteful number, since it uses less digits than its factorization.
106660260 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 200 (or 185 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 27.
The square root of 106660260 is about 10327.6454238127. The cubic root of 106660260 is about 474.2429454795.
The spelling of 106660260 in words is "one hundred six million, six hundred sixty thousand, two hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •