Base | Representation |
---|---|
bin | 1001101010011001111… |
… | …1100010010011110110 |
3 | 120212110222010110220120 |
4 | 2122212133202103312 |
5 | 10204433010321402 |
6 | 204132115512410 |
7 | 14664454035141 |
oct | 2324637422366 |
9 | 525428113816 |
10 | 166002042102 |
11 | 64445909236 |
12 | 282098b8706 |
13 | 1286689c020 |
14 | 806aad5058 |
15 | 44b887a3bc |
hex | 26a67e24f6 |
166002042102 has 128 divisors (see below), whose sum is σ = 380871590400. Its totient is φ = 47782496256.
The previous prime is 166002042097. The next prime is 166002042109. The reversal of 166002042102 is 201240200661.
It is a super-3 number, since 3×1660020421023 (a number of 35 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (166002042109) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 282797053 + ... + 282797639.
It is an arithmetic number, because the mean of its divisors is an integer number (2975559300).
Almost surely, 2166002042102 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 166002042102, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (190435795200).
166002042102 is an abundant number, since it is smaller than the sum of its proper divisors (214869548298).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
166002042102 is a wasteful number, since it uses less digits than its factorization.
166002042102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1550.
The product of its (nonzero) digits is 1152, while the sum is 24.
Adding to 166002042102 its reverse (201240200661), we get a palindrome (367242242763).
The spelling of 166002042102 in words is "one hundred sixty-six billion, two million, forty-two thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •