Base | Representation |
---|---|
bin | 100101110110111010011110… |
… | …101001111110100101101100 |
3 | 210211112101010100001202012010 |
4 | 211312322132221332211230 |
5 | 133310424243141014012 |
6 | 1350041400510441220 |
7 | 50033220005402316 |
oct | 4566723651764554 |
9 | 724471110052163 |
10 | 166501364001132 |
11 | 4906391732a396 |
12 | 168110b5b03210 |
13 | 71ba01b958144 |
14 | 2d189cd77c7b6 |
15 | 143b138a71c3c |
hex | 976e9ea7e96c |
166501364001132 has 48 divisors (see below), whose sum is σ = 401055250176000. Its totient is φ = 53707478119680.
The previous prime is 166501364001127. The next prime is 166501364001139. The reversal of 166501364001132 is 231100463105661.
It is not an unprimeable number, because it can be changed into a prime (166501364001139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3409632 + ... + 18564167.
It is an arithmetic number, because the mean of its divisors is an integer number (8355317712000).
Almost surely, 2166501364001132 is an apocalyptic number.
166501364001132 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
166501364001132 is an abundant number, since it is smaller than the sum of its proper divisors (234553886174868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
166501364001132 is a wasteful number, since it uses less digits than its factorization.
166501364001132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21994206 (or 21994204 counting only the distinct ones).
The product of its (nonzero) digits is 77760, while the sum is 39.
The spelling of 166501364001132 in words is "one hundred sixty-six trillion, five hundred one billion, three hundred sixty-four million, one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •