Base | Representation |
---|---|
bin | 1111100100110… |
… | …00001000110101 |
3 | 100002211112102021 |
4 | 13302120020311 |
5 | 231421142311 |
6 | 20544113141 |
7 | 3144322552 |
oct | 762301065 |
9 | 302745367 |
10 | 130646581 |
11 | 6782378a |
12 | 379057b1 |
13 | 210b3b90 |
14 | 134cba29 |
15 | b70a171 |
hex | 7c98235 |
130646581 has 8 divisors (see below), whose sum is σ = 148972824. Its totient is φ = 113502720.
The previous prime is 130646569. The next prime is 130646587. The reversal of 130646581 is 185646031.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 19660356 + 110986225 = 4434^2 + 10535^2 .
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 130646581 - 29 = 130646069 is a prime.
It is a super-2 number, since 2×1306465812 = 34137058253979122, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130646587) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 295360 + ... + 295801.
It is an arithmetic number, because the mean of its divisors is an integer number (18621603).
Almost surely, 2130646581 is an apocalyptic number.
It is an amenable number.
130646581 is a deficient number, since it is larger than the sum of its proper divisors (18326243).
130646581 is a wasteful number, since it uses less digits than its factorization.
130646581 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 591191.
The product of its (nonzero) digits is 17280, while the sum is 34.
The square root of 130646581 is about 11430.0735343216. The cubic root of 130646581 is about 507.4181718312.
The spelling of 130646581 in words is "one hundred thirty million, six hundred forty-six thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •