Base | Representation |
---|---|
bin | 111100110001011111… |
… | …0010001010111101001 |
3 | 110110212102200001010001 |
4 | 1321202332101113221 |
5 | 4114240413310441 |
6 | 135542155423001 |
7 | 12300101350414 |
oct | 1714276212751 |
9 | 413772601101 |
10 | 130509510121 |
11 | 50392241681 |
12 | 21363454a61 |
13 | c3cb609503 |
14 | 6461018b7b |
15 | 35dc959731 |
hex | 1e62f915e9 |
130509510121 has 27 divisors (see below), whose sum is σ = 138645982839. Its totient is φ = 122840300352.
The previous prime is 130509510101. The next prime is 130509510137. The reversal of 130509510121 is 121015905031.
The square root of 130509510121 is 361261.
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., 2299682025 + 128209828096 = 47955^2 + 358064^2 .
It is not a de Polignac number, because 130509510121 - 27 = 130509509993 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 130509510121.
It is not an unprimeable number, because it can be changed into a prime (130509510101) 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, 938917270 + ... + 938917408.
Almost surely, 2130509510121 is an apocalyptic number.
130509510121 is the 361261-st square number.
130509510121 is the 180631-st centered octagonal number.
It is an amenable number.
130509510121 is a deficient number, since it is larger than the sum of its proper divisors (8136472718).
130509510121 is an frugal number, since it uses more digits than its factorization.
130509510121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 550 (or 275 counting only the distinct ones).
The product of its (nonzero) digits is 1350, while the sum is 28.
The spelling of 130509510121 in words is "one hundred thirty billion, five hundred nine million, five hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •