Base | Representation |
---|---|
bin | 1111100101110… |
… | …00101000010001 |
3 | 100010002021222022 |
4 | 13302320220101 |
5 | 231434422130 |
6 | 20551021225 |
7 | 3145415552 |
oct | 762705021 |
9 | 303067868 |
10 | 130779665 |
11 | 67904775 |
12 | 3796a815 |
13 | 2112c623 |
14 | 13524329 |
15 | b7347e5 |
hex | 7cb8a11 |
130779665 has 4 divisors (see below), whose sum is σ = 156935604. Its totient is φ = 104623728.
The previous prime is 130779653. The next prime is 130779667. The reversal of 130779665 is 566977031.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 566977031 = 2287 ⋅247913.
It can be written as a sum of positive squares in 2 ways, for example, as 58308496 + 72471169 = 7636^2 + 8513^2 .
It is a cyclic number.
It is not a de Polignac number, because 130779665 - 26 = 130779601 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (130779667) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 13077962 + ... + 13077971.
It is an arithmetic number, because the mean of its divisors is an integer number (39233901).
Almost surely, 2130779665 is an apocalyptic number.
It is an amenable number.
130779665 is a deficient number, since it is larger than the sum of its proper divisors (26155939).
130779665 is an equidigital number, since it uses as much as digits as its factorization.
130779665 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26155938.
The product of its (nonzero) digits is 238140, while the sum is 44.
The square root of 130779665 is about 11435.8937123427. The cubic root of 130779665 is about 507.5904083152.
The spelling of 130779665 in words is "one hundred thirty million, seven hundred seventy-nine thousand, six hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •