Base | Representation |
---|---|
bin | 10011110011011… |
… | …11001101100011 |
3 | 102120121022020122 |
4 | 21321233031203 |
5 | 320012134111 |
6 | 24252430455 |
7 | 4055041400 |
oct | 1171571543 |
9 | 376538218 |
10 | 166130531 |
11 | 8585a366 |
12 | 4777842b |
13 | 28558cb8 |
14 | 180c72a7 |
15 | e8b8cdb |
hex | 9e6f363 |
166130531 has 12 divisors (see below), whose sum is σ = 199919520. Its totient is φ = 137486160.
The previous prime is 166130527. The next prime is 166130563. The reversal of 166130531 is 135031661.
It is not a de Polignac number, because 166130531 - 22 = 166130527 is a prime.
It is a super-2 number, since 2×1661305312 = 55198706660683922, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 166130531.
It is not an unprimeable number, because it can be changed into a prime (166130521) by changing a digit.
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 11 ways as a sum of consecutive naturals, for example, 57035 + ... + 59876.
It is an arithmetic number, because the mean of its divisors is an integer number (16659960).
Almost surely, 2166130531 is an apocalyptic number.
166130531 is a deficient number, since it is larger than the sum of its proper divisors (33788989).
166130531 is a wasteful number, since it uses less digits than its factorization.
166130531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 116954 (or 116947 counting only the distinct ones).
The product of its (nonzero) digits is 1620, while the sum is 26.
The square root of 166130531 is about 12889.1633165229. The cubic root of 166130531 is about 549.7304806198.
It can be divided in two parts, 166130 and 531, that added together give a palindrome (166661).
The spelling of 166130531 in words is "one hundred sixty-six million, one hundred thirty thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •