Base | Representation |
---|---|
bin | 1011101001000100… |
… | …0101101111010011 |
3 | 22001210022120220011 |
4 | 2322101011233103 |
5 | 22400002322011 |
6 | 1234032255351 |
7 | 140304264001 |
oct | 27221055723 |
9 | 8053276804 |
10 | 3125042131 |
11 | 1364006452 |
12 | 7326a1557 |
13 | 3aa585473 |
14 | 219075a71 |
15 | 134543621 |
hex | ba445bd3 |
3125042131 has 4 divisors (see below), whose sum is σ = 3260913552. Its totient is φ = 2989170712.
The previous prime is 3125042087. The next prime is 3125042143. The reversal of 3125042131 is 1312405213.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a de Polignac number, because none of the positive numbers 2k-3125042131 is a prime.
It is a super-2 number, since 2×31250421312 = 19531776641050042322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3125042161) 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 3 ways as a sum of consecutive naturals, for example, 67935676 + ... + 67935721.
It is an arithmetic number, because the mean of its divisors is an integer number (815228388).
Almost surely, 23125042131 is an apocalyptic number.
3125042131 is a deficient number, since it is larger than the sum of its proper divisors (135871421).
3125042131 is a wasteful number, since it uses less digits than its factorization.
3125042131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135871420.
The product of its (nonzero) digits is 720, while the sum is 22.
The square root of 3125042131 is about 55902.0762673445. The cubic root of 3125042131 is about 1462.0154393058.
Adding to 3125042131 its reverse (1312405213), we get a palindrome (4437447344).
The spelling of 3125042131 in words is "three billion, one hundred twenty-five million, forty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •