Base | Representation |
---|---|
bin | 1111100110000… |
… | …11011110001111 |
3 | 100010011112220021 |
4 | 13303003132033 |
5 | 231442332304 |
6 | 20552003011 |
7 | 3145662211 |
oct | 763033617 |
9 | 303145807 |
10 | 130824079 |
11 | 67935081 |
12 | 37990467 |
13 | 211468c9 |
14 | 135365b1 |
15 | b742a54 |
hex | 7cc378f |
130824079 has 8 divisors (see below), whose sum is σ = 132768320. Its totient is φ = 128887200.
The previous prime is 130824073. The next prime is 130824091. The reversal of 130824079 is 970428031.
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 130824079 - 211 = 130822031 is a prime.
It is a super-2 number, since 2×1308240792 = 34229879292396482, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130824073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 41209 + ... + 44269.
It is an arithmetic number, because the mean of its divisors is an integer number (16596040).
Almost surely, 2130824079 is an apocalyptic number.
130824079 is a deficient number, since it is larger than the sum of its proper divisors (1944241).
130824079 is an equidigital number, since it uses as much as digits as its factorization.
130824079 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3681.
The product of its (nonzero) digits is 12096, while the sum is 34.
The square root of 130824079 is about 11437.8354158468. The cubic root of 130824079 is about 507.6478626317.
It can be divided in two parts, 13082 and 4079, that added together give a square (17161 = 1312).
The spelling of 130824079 in words is "one hundred thirty million, eight hundred twenty-four thousand, seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •