Base | Representation |
---|---|
bin | 10011110100010… |
… | …11011010100010 |
3 | 102120211011201010 |
4 | 21322023122202 |
5 | 320024333200 |
6 | 24255121350 |
7 | 4056032235 |
oct | 1172133242 |
9 | 376734633 |
10 | 166246050 |
11 | 85929133 |
12 | 47813256 |
13 | 28599759 |
14 | 1811741c |
15 | e8dd150 |
hex | 9e8b6a2 |
166246050 has 48 divisors (see below), whose sum is σ = 421080192. Its totient is φ = 43387200.
The previous prime is 166246049. The next prime is 166246057. The reversal of 166246050 is 50642661.
166246050 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 166245999 and 166246017.
It is not an unprimeable number, because it can be changed into a prime (166246057) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 4741 + ... + 18840.
It is an arithmetic number, because the mean of its divisors is an integer number (8772504).
Almost surely, 2166246050 is an apocalyptic number.
166246050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
166246050 is an abundant number, since it is smaller than the sum of its proper divisors (254834142).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
166246050 is a wasteful number, since it uses less digits than its factorization.
166246050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 23643 (or 23638 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 30.
The square root of 166246050 is about 12893.6437828878. The cubic root of 166246050 is about 549.8578696101.
The spelling of 166246050 in words is "one hundred sixty-six million, two hundred forty-six thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •