Base | Representation |
---|---|
bin | 1111100110111… |
… | …01110110010001 |
3 | 100010101001002112 |
4 | 13303131312101 |
5 | 232004311423 |
6 | 20554155105 |
7 | 3146622164 |
oct | 763356621 |
9 | 303331075 |
10 | 130932113 |
11 | 679a9264 |
12 | 37a22a95 |
13 | 21183b30 |
14 | 13563adb |
15 | b764a78 |
hex | 7cddd91 |
130932113 has 8 divisors (see below), whose sum is σ = 149298408. Its totient is φ = 113750784.
The previous prime is 130932091. The next prime is 130932157. The reversal of 130932113 is 311239031.
It can be written as a sum of positive squares in 4 ways, for example, as 24285184 + 106646929 = 4928^2 + 10327^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 130932113 - 216 = 130866577 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130932163) 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 7 ways as a sum of consecutive naturals, for example, 296006 + ... + 296447.
It is an arithmetic number, because the mean of its divisors is an integer number (18662301).
Almost surely, 2130932113 is an apocalyptic number.
130932113 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
130932113 is a deficient number, since it is larger than the sum of its proper divisors (18366295).
130932113 is a wasteful number, since it uses less digits than its factorization.
130932113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 592483.
The product of its (nonzero) digits is 486, while the sum is 23.
The square root of 130932113 is about 11442.5571005785. The cubic root of 130932113 is about 507.7875620410.
The spelling of 130932113 in words is "one hundred thirty million, nine hundred thirty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •