Base | Representation |
---|---|
bin | 111100101001111111… |
… | …1100100110010100001 |
3 | 110110012220202211121121 |
4 | 1321103333210302201 |
5 | 4113232044143234 |
6 | 135501221052241 |
7 | 12260630243200 |
oct | 1712377446241 |
9 | 413186684547 |
10 | 130258193569 |
11 | 50273399849 |
12 | 212b3257081 |
13 | c38b5257aa |
14 | 64398b9237 |
15 | 35c58654b4 |
hex | 1e53fe4ca1 |
130258193569 has 27 divisors (see below), whose sum is σ = 154958621043. Its totient is φ = 109174738848.
The previous prime is 130258193531. The next prime is 130258193573. The reversal of 130258193569 is 965391852031.
The square root of 130258193569 is 360913.
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., 37042776225 + 93215417344 = 192465^2 + 305312^2 .
It is not a de Polignac number, because 130258193569 - 211 = 130258191521 is a prime.
It is a super-2 number, since 2×1302581935692 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130258193519) by changing a digit.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 118739829 + ... + 118740925.
Almost surely, 2130258193569 is an apocalyptic number.
130258193569 is the 360913-rd square number.
130258193569 is the 180457-th centered octagonal number.
It is an amenable number.
130258193569 is a deficient number, since it is larger than the sum of its proper divisors (24700427474).
130258193569 is an frugal number, since it uses more digits than its factorization.
130258193569 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2302 (or 1151 counting only the distinct ones).
The product of its (nonzero) digits is 1749600, while the sum is 52.
The spelling of 130258193569 in words is "one hundred thirty billion, two hundred fifty-eight million, one hundred ninety-three thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.129 sec. • engine limits •