Base | Representation |
---|---|
bin | 11000100011001000… |
… | …01010100110000101 |
3 | 1021000111201210200101 |
4 | 30101210022212011 |
5 | 203442434021031 |
6 | 10015444244101 |
7 | 644413465426 |
oct | 142144124605 |
9 | 37014653611 |
10 | 13179595141 |
11 | 56535a0999 |
12 | 26799a0631 |
13 | 132066350b |
14 | 8d055964d |
15 | 5220ca361 |
hex | 31190a985 |
13179595141 has 8 divisors (see below), whose sum is σ = 13342671000. Its totient is φ = 13017158400.
The previous prime is 13179595129. The next prime is 13179595199. The reversal of 13179595141 is 14159597131.
It can be written as a sum of positive squares in 4 ways, for example, as 8073921025 + 5105674116 = 89855^2 + 71454^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 13179595141 - 211 = 13179593093 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13179595091 and 13179595100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13179575141) 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 7 ways as a sum of consecutive naturals, for example, 118216 + ... + 200833.
It is an arithmetic number, because the mean of its divisors is an integer number (1667833875).
Almost surely, 213179595141 is an apocalyptic number.
It is an amenable number.
13179595141 is a deficient number, since it is larger than the sum of its proper divisors (163075859).
13179595141 is a wasteful number, since it uses less digits than its factorization.
13179595141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 319559.
The product of its digits is 170100, while the sum is 46.
The spelling of 13179595141 in words is "thirteen billion, one hundred seventy-nine million, five hundred ninety-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •