Base | Representation |
---|---|
bin | 111100000111010101010… |
… | …000110101010100000101 |
3 | 112121220221101110012200102 |
4 | 330013111100311110011 |
5 | 1020140333112444031 |
6 | 12441435124453445 |
7 | 604313026434320 |
oct | 74072520652405 |
9 | 15556841405612 |
10 | 4131041531141 |
11 | 1352a68280538 |
12 | 56875954a285 |
13 | 23c72b6bbb85 |
14 | 103d2cc877b7 |
15 | 726d04a57cb |
hex | 3c1d5435505 |
4131041531141 has 8 divisors (see below), whose sum is σ = 4721203072320. Its totient is φ = 3540883177728.
The previous prime is 4131041531117. The next prime is 4131041531173. The reversal of 4131041531141 is 1411351401314.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4131041531141 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4131041530141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3589790 + ... + 4598768.
It is an arithmetic number, because the mean of its divisors is an integer number (590150384040).
Almost surely, 24131041531141 is an apocalyptic number.
It is an amenable number.
4131041531141 is a deficient number, since it is larger than the sum of its proper divisors (590161541179).
4131041531141 is a wasteful number, since it uses less digits than its factorization.
4131041531141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1593883.
The product of its (nonzero) digits is 2880, while the sum is 29.
Adding to 4131041531141 its reverse (1411351401314), we get a palindrome (5542392932455).
The spelling of 4131041531141 in words is "four trillion, one hundred thirty-one billion, forty-one million, five hundred thirty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •