Base | Representation |
---|---|
bin | 1111100101001… |
… | …10101011011101 |
3 | 100002221120010012 |
4 | 13302212223131 |
5 | 231430044031 |
6 | 20545253005 |
7 | 3144661316 |
oct | 762465335 |
9 | 302846105 |
10 | 130706141 |
11 | 67864505 |
12 | 37934165 |
13 | 21105017 |
14 | 1350560d |
15 | b71cb2b |
hex | 7ca6add |
130706141 has 4 divisors (see below), whose sum is σ = 130948284. Its totient is φ = 130464000.
The previous prime is 130706131. The next prime is 130706143. The reversal of 130706141 is 141607031.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 55190041 + 75516100 = 7429^2 + 8690^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-130706141 is a prime.
It is a super-2 number, since 2×1307061412 = 34168190590223762, 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 (130706143) 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 3 ways as a sum of consecutive naturals, for example, 120260 + ... + 121341.
It is an arithmetic number, because the mean of its divisors is an integer number (32737071).
Almost surely, 2130706141 is an apocalyptic number.
It is an amenable number.
130706141 is a deficient number, since it is larger than the sum of its proper divisors (242143).
130706141 is an equidigital number, since it uses as much as digits as its factorization.
130706141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 242142.
The product of its (nonzero) digits is 504, while the sum is 23.
The square root of 130706141 is about 11432.6786450070. The cubic root of 130706141 is about 507.4952684652.
The spelling of 130706141 in words is "one hundred thirty million, seven hundred six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •