Base | Representation |
---|---|
bin | 1111100010110… |
… | …10010111011001 |
3 | 100002100200100011 |
4 | 13301122113121 |
5 | 231340043221 |
6 | 20534441521 |
7 | 3142220104 |
oct | 761322731 |
9 | 302320304 |
10 | 130393561 |
11 | 67670681 |
12 | 378032a1 |
13 | 2102596c |
14 | 1346373b |
15 | b6aa1e1 |
hex | 7c5a5d9 |
130393561 has 9 divisors (see below), whose sum is σ = 137846943. Its totient is φ = 123325200.
The previous prime is 130393531. The next prime is 130393573. The reversal of 130393561 is 165393031.
The square root of 130393561 is 11419.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 109599961 + 20793600 = 10469^2 + 4560^2 .
It is a de Polignac number, because none of the positive numbers 2k-130393561 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130393531) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 216661 + ... + 217261.
It is an arithmetic number, because the mean of its divisors is an integer number (15316327).
Almost surely, 2130393561 is an apocalyptic number.
130393561 is the 11419-th square number.
130393561 is the 5710-th centered octagonal number.
It is an amenable number.
130393561 is a deficient number, since it is larger than the sum of its proper divisors (7453382).
130393561 is an frugal number, since it uses more digits than its factorization.
130393561 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1240 (or 620 counting only the distinct ones).
The product of its (nonzero) digits is 7290, while the sum is 31.
The cubic root of 130393561 is about 507.0903920674.
It can be divided in two parts, 1303 and 93561, that added together give a square (94864 = 3082).
The spelling of 130393561 in words is "one hundred thirty million, three hundred ninety-three thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •