Base | Representation |
---|---|
bin | 11101101101001101111000… |
… | …011001011001110110001101 |
3 | 122010121002010001100000220022 |
4 | 131231031320121121312031 |
5 | 114111034442301234123 |
6 | 1141512023151031525 |
7 | 36343124260264511 |
oct | 3555157031316615 |
9 | 563532101300808 |
10 | 130650630102413 |
11 | 386a1691702073 |
12 | 127a0b7380b5a5 |
13 | 57b93bc68a775 |
14 | 243974a714141 |
15 | 10187c92731c8 |
hex | 76d378659d8d |
130650630102413 has 8 divisors (see below), whose sum is σ = 130886157956928. Its totient is φ = 130415114541024.
The previous prime is 130650630102389. The next prime is 130650630102431. The reversal of 130650630102413 is 314201036056031.
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 130650630102413 - 246 = 60281885924749 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130650630002413) 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, 18336056 + ... + 24444062.
It is an arithmetic number, because the mean of its divisors is an integer number (16360769744616).
Almost surely, 2130650630102413 is an apocalyptic number.
It is an amenable number.
130650630102413 is a deficient number, since it is larger than the sum of its proper divisors (235527854515).
130650630102413 is an equidigital number, since it uses as much as digits as its factorization.
130650630102413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6146563.
The product of its (nonzero) digits is 38880, while the sum is 35.
Adding to 130650630102413 its reverse (314201036056031), we get a palindrome (444851666158444).
The spelling of 130650630102413 in words is "one hundred thirty trillion, six hundred fifty billion, six hundred thirty million, one hundred two thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •