Base | Representation |
---|---|
bin | 10011110110100… |
… | …11001101100011 |
3 | 102121101010010000 |
4 | 21323103031203 |
5 | 320113241011 |
6 | 24305311043 |
7 | 4061365512 |
oct | 1173231543 |
9 | 377333100 |
10 | 166540131 |
11 | 8600a07a |
12 | 47935483 |
13 | 28670574 |
14 | 18192679 |
15 | e94a356 |
hex | 9ed3363 |
166540131 has 20 divisors (see below), whose sum is σ = 250470000. Its totient is φ = 110273616.
The previous prime is 166540103. The next prime is 166540141. The reversal of 166540131 is 131045661.
166540131 is a `hidden beast` number, since 1 + 6 + 654 + 0 + 1 + 3 + 1 = 666.
It is not a de Polignac number, because 166540131 - 217 = 166409059 is a prime.
It is a super-2 number, since 2×1665401312 = 55471230466994322, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 166540095 and 166540104.
It is not an unprimeable number, because it can be changed into a prime (166540141) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 5170 + ... + 18968.
It is an arithmetic number, because the mean of its divisors is an integer number (12523500).
Almost surely, 2166540131 is an apocalyptic number.
166540131 is a deficient number, since it is larger than the sum of its proper divisors (83929869).
166540131 is a wasteful number, since it uses less digits than its factorization.
166540131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13960 (or 13951 counting only the distinct ones).
The product of its (nonzero) digits is 2160, while the sum is 27.
The square root of 166540131 is about 12905.0428515368. The cubic root of 166540131 is about 550.1819023669.
Adding to 166540131 its reverse (131045661), we get a palindrome (297585792).
The spelling of 166540131 in words is "one hundred sixty-six million, five hundred forty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 5.092 sec. • engine limits •