Base | Representation |
---|---|
bin | 1111100001110… |
… | …00111010111001 |
3 | 100002002201102101 |
4 | 13300320322321 |
5 | 231321202234 |
6 | 20531503401 |
7 | 3141106522 |
oct | 760707271 |
9 | 302081371 |
10 | 130256569 |
11 | 67587763 |
12 | 37757b61 |
13 | 20ca84c1 |
14 | 13429849 |
15 | b67e814 |
hex | 7c38eb9 |
130256569 has 9 divisors (see below), whose sum is σ = 132733549. Its totient is φ = 127825600.
The previous prime is 130256551. The next prime is 130256587. The reversal of 130256569 is 965652031.
The square root of 130256569 is 11413.
It is a perfect power (a square), and thus also a powerful number.
It is an interprime number because it is at equal distance from previous prime (130256551) and next prime (130256587).
It can be written as a sum of positive squares in 4 ways, for example, as 570025 + 129686544 = 755^2 + 11388^2 .
It is a de Polignac number, because none of the positive numbers 2k-130256569 is a prime.
It is a super-2 number, since 2×1302565692 = 33933547535303522, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130256369) 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, 1152657 + ... + 1152769.
Almost surely, 2130256569 is an apocalyptic number.
130256569 is the 11413-rd square number.
130256569 is the 5707-th centered octagonal number.
It is an amenable number.
130256569 is a deficient number, since it is larger than the sum of its proper divisors (2476980).
130256569 is an frugal number, since it uses more digits than its factorization.
130256569 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 428 (or 214 counting only the distinct ones).
The product of its (nonzero) digits is 48600, while the sum is 37.
The cubic root of 130256569 is about 506.9127461054.
The spelling of 130256569 in words is "one hundred thirty million, two hundred fifty-six thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •