Base | Representation |
---|---|
bin | 10011110111111… |
… | …01011110001100 |
3 | 102121200220120000 |
4 | 21323331132030 |
5 | 320134310403 |
6 | 24313124300 |
7 | 4063016253 |
oct | 1173753614 |
9 | 377626500 |
10 | 166713228 |
11 | 86118130 |
12 | 479b9690 |
13 | 287012a6 |
14 | 181d979a |
15 | e9817a3 |
hex | 9efd78c |
166713228 has 120 divisors (see below), whose sum is σ = 492140880. Its totient is φ = 48746880.
The previous prime is 166713181. The next prime is 166713233. The reversal of 166713228 is 822317661.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 166713192 and 166713201.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 102550 + ... + 104162.
It is an arithmetic number, because the mean of its divisors is an integer number (4101174).
Almost surely, 2166713228 is an apocalyptic number.
166713228 is a gapful number since it is divisible by the number (18) 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 166713228, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (246070440).
166713228 is an abundant number, since it is smaller than the sum of its proper divisors (325427652).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
166713228 is a wasteful number, since it uses less digits than its factorization.
166713228 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1669 (or 1658 counting only the distinct ones).
The product of its digits is 24192, while the sum is 36.
The square root of 166713228 is about 12911.7476741145. The cubic root of 166713228 is about 550.3724507560.
The spelling of 166713228 in words is "one hundred sixty-six million, seven hundred thirteen thousand, two hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •