Base | Representation |
---|---|
bin | 11111100110011… |
… | …011000101110011 |
3 | 1100221121020012122 |
4 | 133212123011303 |
5 | 2041210304011 |
6 | 124335144455 |
7 | 16065223565 |
oct | 3746330563 |
9 | 1327536178 |
10 | 530166131 |
11 | 2522a0730 |
12 | 12967512b |
13 | 85ab7891 |
14 | 505a9335 |
15 | 318263db |
hex | 1f99b173 |
530166131 has 8 divisors (see below), whose sum is σ = 612384624. Its totient is φ = 453617920.
The previous prime is 530166113. The next prime is 530166137. The reversal of 530166131 is 131661035.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 530166131 - 210 = 530165107 is a prime.
It is a super-2 number, since 2×5301661312 = 562152252919018322, 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 530166131.
It is not an unprimeable number, because it can be changed into a prime (530166137) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1417370 + ... + 1417743.
It is an arithmetic number, because the mean of its divisors is an integer number (76548078).
Almost surely, 2530166131 is an apocalyptic number.
530166131 is a deficient number, since it is larger than the sum of its proper divisors (82218493).
530166131 is a wasteful number, since it uses less digits than its factorization.
530166131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2835141.
The product of its (nonzero) digits is 1620, while the sum is 26.
The square root of 530166131 is about 23025.3367184934. The cubic root of 530166131 is about 809.3517808339.
It can be divided in two parts, 530 and 166131, that added together give a palindrome (166661).
The spelling of 530166131 in words is "five hundred thirty million, one hundred sixty-six thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •