Base | Representation |
---|---|
bin | 111100101001001110… |
… | …0011100111011101001 |
3 | 110110011002212200122221 |
4 | 1321102130130323221 |
5 | 4113203421143004 |
6 | 135454452114041 |
7 | 12260163340621 |
oct | 1712234347351 |
9 | 413132780587 |
10 | 130232209129 |
11 | 5025a761300 |
12 | 212a6605921 |
13 | c386028499 |
14 | 6436273881 |
15 | 35c3431354 |
hex | 1e5271cee9 |
130232209129 has 27 divisors (see below), whose sum is σ = 146135745399. Its totient is φ = 115971432720.
The previous prime is 130232209127. The next prime is 130232209141. The reversal of 130232209129 is 921902232031.
The square root of 130232209129 is 360877.
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., 93884024025 + 36348185104 = 306405^2 + 190652^2 .
It is not a de Polignac number, because 130232209129 - 21 = 130232209127 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130232209094 and 130232209103.
It is not an unprimeable number, because it can be changed into a prime (130232209127) 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, 210390982 + ... + 210391600.
Almost surely, 2130232209129 is an apocalyptic number.
130232209129 is the 360877-th square number.
130232209129 is the 180439-th centered octagonal number.
It is an amenable number.
130232209129 is a deficient number, since it is larger than the sum of its proper divisors (15903536270).
130232209129 is an frugal number, since it uses more digits than its factorization.
130232209129 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1366 (or 683 counting only the distinct ones).
The product of its (nonzero) digits is 11664, while the sum is 34.
The spelling of 130232209129 in words is "one hundred thirty billion, two hundred thirty-two million, two hundred nine thousand, one hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •