Base | Representation |
---|---|
bin | 1001101010111100000… |
… | …1010010001101101000 |
3 | 120212211221022220202210 |
4 | 2122233001102031220 |
5 | 10210231121404132 |
6 | 204154230125120 |
7 | 15001142051310 |
oct | 2325701221550 |
9 | 525757286683 |
10 | 166145106792 |
11 | 64509643915 |
12 | 282497b07a0 |
13 | 1288a4102a2 |
14 | 8081ad6440 |
15 | 44c61d9bcc |
hex | 26af052368 |
166145106792 has 128 divisors (see below), whose sum is σ = 503216409600. Its totient is φ = 44625005568.
The previous prime is 166145106733. The next prime is 166145106821. The reversal of 166145106792 is 297601541661.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2419443 + ... + 2487165.
It is an arithmetic number, because the mean of its divisors is an integer number (3931378200).
Almost surely, 2166145106792 is an apocalyptic number.
166145106792 is a gapful number since it is divisible by the number (12) 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 166145106792, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (251608204800).
166145106792 is an abundant number, since it is smaller than the sum of its proper divisors (337071302808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
166145106792 is a wasteful number, since it uses less digits than its factorization.
166145106792 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 68615 (or 68611 counting only the distinct ones).
The product of its (nonzero) digits is 544320, while the sum is 48.
The spelling of 166145106792 in words is "one hundred sixty-six billion, one hundred forty-five million, one hundred six thousand, seven hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •