Base | Representation |
---|---|
bin | 1111100011001… |
… | …10101101101101 |
3 | 100002110020201111 |
4 | 13301212231231 |
5 | 231343203031 |
6 | 20535512021 |
7 | 3142520422 |
oct | 761465555 |
9 | 302406644 |
10 | 130444141 |
11 | 676a5683 |
12 | 37828611 |
13 | 210429a9 |
14 | 13477d49 |
15 | b6ba1b1 |
hex | 7c66b6d |
130444141 has 8 divisors (see below), whose sum is σ = 131437944. Its totient is φ = 129454080.
The previous prime is 130444091. The next prime is 130444151. The reversal of 130444141 is 141444031.
It can be written as a sum of positive squares in 4 ways, for example, as 117267241 + 13176900 = 10829^2 + 3630^2 .
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 130444141 - 223 = 122055533 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 (130444151) 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, 125761 + ... + 126793.
It is an arithmetic number, because the mean of its divisors is an integer number (16429743).
Almost surely, 2130444141 is an apocalyptic number.
It is an amenable number.
130444141 is a deficient number, since it is larger than the sum of its proper divisors (993803).
130444141 is a wasteful number, since it uses less digits than its factorization.
130444141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1871.
The product of its (nonzero) digits is 768, while the sum is 22.
The square root of 130444141 is about 11421.2145151030. The cubic root of 130444141 is about 507.1559508168.
Adding to 130444141 its reverse (141444031), we get a palindrome (271888172).
The spelling of 130444141 in words is "one hundred thirty million, four hundred forty-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •