Base | Representation |
---|---|
bin | 10011110101000… |
… | …00101111010110 |
3 | 102120222121112020 |
4 | 21322200233112 |
5 | 320040132043 |
6 | 24301034010 |
7 | 4056545010 |
oct | 1172405726 |
9 | 376877466 |
10 | 166333398 |
11 | 85988820 |
12 | 47855906 |
13 | 285ca43a |
14 | 1813b1b0 |
15 | e908e83 |
hex | 9ea0bd6 |
166333398 has 64 divisors (see below), whose sum is σ = 422641152. Its totient is φ = 42382080.
The previous prime is 166333393. The next prime is 166333403. The reversal of 166333398 is 893333661.
It is an interprime number because it is at equal distance from previous prime (166333393) and next prime (166333403).
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (166333393) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 21090 + ... + 27882.
It is an arithmetic number, because the mean of its divisors is an integer number (6603768).
Almost surely, 2166333398 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 166333398, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (211320576).
166333398 is an abundant number, since it is smaller than the sum of its proper divisors (256307754).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
166333398 is a wasteful number, since it uses less digits than its factorization.
166333398 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6869.
The product of its digits is 209952, while the sum is 42.
The square root of 166333398 is about 12897.0305884727. The cubic root of 166333398 is about 549.9541537543.
The spelling of 166333398 in words is "one hundred sixty-six million, three hundred thirty-three thousand, three hundred ninety-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •