Base | Representation |
---|---|
bin | 1111100011110… |
… | …10000001001001 |
3 | 100002121021011221 |
4 | 13301322001021 |
5 | 231403220314 |
6 | 20541322041 |
7 | 3143300065 |
oct | 761720111 |
9 | 302537157 |
10 | 130523209 |
11 | 6774a023 |
12 | 37866321 |
13 | 2106c98b |
14 | 13498aa5 |
15 | b6d3824 |
hex | 7c7a049 |
130523209 has 4 divisors (see below), whose sum is σ = 131815620. Its totient is φ = 129230800.
The previous prime is 130523207. The next prime is 130523219. The reversal of 130523209 is 902325031.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 73188025 + 57335184 = 8555^2 + 7572^2 .
It is a cyclic number.
It is not a de Polignac number, because 130523209 - 21 = 130523207 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130523207) 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 3 ways as a sum of consecutive naturals, for example, 646054 + ... + 646255.
It is an arithmetic number, because the mean of its divisors is an integer number (32953905).
Almost surely, 2130523209 is an apocalyptic number.
It is an amenable number.
130523209 is a deficient number, since it is larger than the sum of its proper divisors (1292411).
130523209 is a wasteful number, since it uses less digits than its factorization.
130523209 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1292410.
The product of its (nonzero) digits is 1620, while the sum is 25.
The square root of 130523209 is about 11424.6754439678. The cubic root of 130523209 is about 507.2584000517.
It can be divided in two parts, 13052 and 3209, that added together give a palindrome (16261).
The spelling of 130523209 in words is "one hundred thirty million, five hundred twenty-three thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •