Base | Representation |
---|---|
bin | 11101100100100100101101… |
… | …000010111001011111001011 |
3 | 122001111021222021121002101011 |
4 | 131210210231002321133023 |
5 | 114021322020032042101 |
6 | 1140335112135304351 |
7 | 36252166200315052 |
oct | 3544445502713713 |
9 | 561437867532334 |
10 | 130056660424651 |
11 | 384927a126a964 |
12 | 12705a2851b0b7 |
13 | 57753a118488c |
14 | 2418ac12d3399 |
15 | 1008113a2c751 |
hex | 76492d0b97cb |
130056660424651 has 8 divisors (see below), whose sum is σ = 132271359620400. Its totient is φ = 127842306196320.
The previous prime is 130056660424643. The next prime is 130056660424697. The reversal of 130056660424651 is 156424066650031.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 130056660424651 - 23 = 130056660424643 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130056660424595 and 130056660424604.
It is not an unprimeable number, because it can be changed into a prime (130056660424601) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 85481356 + ... + 86989513.
It is an arithmetic number, because the mean of its divisors is an integer number (16533919952550).
Almost surely, 2130056660424651 is an apocalyptic number.
130056660424651 is a deficient number, since it is larger than the sum of its proper divisors (2214699195749).
130056660424651 is a wasteful number, since it uses less digits than its factorization.
130056660424651 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 172483709.
The product of its (nonzero) digits is 3110400, while the sum is 49.
The spelling of 130056660424651 in words is "one hundred thirty trillion, fifty-six billion, six hundred sixty million, four hundred twenty-four thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •