Base | Representation |
---|---|
bin | 10011110100100… |
… | …00010001000000 |
3 | 102120212011222001 |
4 | 21322100101000 |
5 | 320031002140 |
6 | 24255353344 |
7 | 4056144202 |
oct | 1172202100 |
9 | 376764861 |
10 | 166265920 |
11 | 85942057 |
12 | 47822854 |
13 | 285a5802 |
14 | 18120772 |
15 | e8e3e9a |
hex | 9e90440 |
166265920 has 28 divisors (see below), whose sum is σ = 395921484. Its totient is φ = 66506240.
The previous prime is 166265881. The next prime is 166265959. The reversal of 166265920 is 29562661.
It is an interprime number because it is at equal distance from previous prime (166265881) and next prime (166265959).
It can be written as a sum of positive squares in 2 ways, for example, as 106172416 + 60093504 = 10304^2 + 7752^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 166265920.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 259471 + ... + 260110.
It is an arithmetic number, because the mean of its divisors is an integer number (14140053).
Almost surely, 2166265920 is an apocalyptic number.
166265920 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
166265920 is an abundant number, since it is smaller than the sum of its proper divisors (229655564).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
166265920 is an equidigital number, since it uses as much as digits as its factorization.
166265920 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 519598 (or 519588 counting only the distinct ones).
The product of its (nonzero) digits is 38880, while the sum is 37.
The square root of 166265920 is about 12894.4142945696. The cubic root of 166265920 is about 549.8797753749.
The spelling of 166265920 in words is "one hundred sixty-six million, two hundred sixty-five thousand, nine hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •