Base | Representation |
---|---|
bin | 100101011010000001101… |
… | …0010100100100111011011 |
3 | 200012111011021002110220220 |
4 | 1022310003102210213123 |
5 | 1133213014022203111 |
6 | 14533445240451123 |
7 | 1040302006631454 |
oct | 112640322444733 |
9 | 20174137073826 |
10 | 5141131053531 |
11 | 17023834a5990 |
12 | 6b0476479aa3 |
13 | 2b3a6408a5b5 |
14 | 13ab912b812b |
15 | 8daec8aee06 |
hex | 4ad034a49db |
5141131053531 has 32 divisors (see below), whose sum is σ = 7569935557632. Its totient is φ = 3077722421760.
The previous prime is 5141131053481. The next prime is 5141131053533. The reversal of 5141131053531 is 1353501311415.
It is not a de Polignac number, because 5141131053531 - 218 = 5141130791387 is a prime.
It is a super-2 number, since 2×51411310535312 (a number of 26 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 5141131053492 and 5141131053501.
It is not an unprimeable number, because it can be changed into a prime (5141131053533) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1260115 + ... + 3445308.
It is an arithmetic number, because the mean of its divisors is an integer number (236560486176).
Almost surely, 25141131053531 is an apocalyptic number.
5141131053531 is a deficient number, since it is larger than the sum of its proper divisors (2428804504101).
5141131053531 is a wasteful number, since it uses less digits than its factorization.
5141131053531 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4705843.
The product of its (nonzero) digits is 13500, while the sum is 33.
Adding to 5141131053531 its reverse (1353501311415), we get a palindrome (6494632364946).
The spelling of 5141131053531 in words is "five trillion, one hundred forty-one billion, one hundred thirty-one million, fifty-three thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •