Base | Representation |
---|---|
bin | 1011101000001011… |
… | …01111110111100101 |
3 | 121010001121112000210 |
4 | 11310011233313211 |
5 | 100241103144031 |
6 | 2511241130033 |
7 | 310461326535 |
oct | 56405576745 |
9 | 17101545023 |
10 | 6242631141 |
11 | 271389119a |
12 | 1262789919 |
13 | 78642b3a6 |
14 | 43312b4c5 |
15 | 2680b3746 |
hex | 17416fde5 |
6242631141 has 4 divisors (see below), whose sum is σ = 8323508192. Its totient is φ = 4161754092.
The previous prime is 6242631137. The next prime is 6242631173. The reversal of 6242631141 is 1411362426.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is not a de Polignac number, because 6242631141 - 22 = 6242631137 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 6242631099 and 6242631108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6242631121) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1040438521 + ... + 1040438526.
It is an arithmetic number, because the mean of its divisors is an integer number (2080877048).
Almost surely, 26242631141 is an apocalyptic number.
It is an amenable number.
6242631141 is a deficient number, since it is larger than the sum of its proper divisors (2080877051).
6242631141 is a wasteful number, since it uses less digits than its factorization.
6242631141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2080877050.
The product of its digits is 6912, while the sum is 30.
The square root of 6242631141 is about 79010.3230027571. The cubic root of 6242631141 is about 1841.2915417301.
Adding to 6242631141 its reverse (1411362426), we get a palindrome (7653993567).
The spelling of 6242631141 in words is "six billion, two hundred forty-two million, six hundred thirty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •