Base | Representation |
---|---|
bin | 1111100011000… |
… | …01110100110101 |
3 | 100002102020020212 |
4 | 13301201310311 |
5 | 231342032432 |
6 | 20535235205 |
7 | 3142405145 |
oct | 761416465 |
9 | 302366225 |
10 | 130424117 |
11 | 6769162a |
12 | 37818b05 |
13 | 21036845 |
14 | 13470925 |
15 | b6b42b2 |
hex | 7c61d35 |
130424117 has 8 divisors (see below), whose sum is σ = 134423520. Its totient is φ = 126468720.
The previous prime is 130424111. The next prime is 130424123. The reversal of 130424117 is 711424031.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (130424111) and next prime (130424123).
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 130424117 - 28 = 130423861 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130424092 and 130424101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130424111) 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, 4934 + ... + 16887.
It is an arithmetic number, because the mean of its divisors is an integer number (16802940).
Almost surely, 2130424117 is an apocalyptic number.
It is an amenable number.
130424117 is a deficient number, since it is larger than the sum of its proper divisors (3999403).
130424117 is a wasteful number, since it uses less digits than its factorization.
130424117 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22003.
The product of its (nonzero) digits is 672, while the sum is 23.
The square root of 130424117 is about 11420.3378671561. The cubic root of 130424117 is about 507.1299989410.
Adding to 130424117 its reverse (711424031), we get a palindrome (841848148).
The spelling of 130424117 in words is "one hundred thirty million, four hundred twenty-four thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •