Base | Representation |
---|---|
bin | 1011010111011100… |
… | …0111100110001011 |
3 | 21212122020012211111 |
4 | 2311313013212023 |
5 | 22222042001011 |
6 | 1222432111151 |
7 | 135416064355 |
oct | 26567074613 |
9 | 7778205744 |
10 | 3051125131 |
11 | 132630a51a |
12 | 7119954b7 |
13 | 398174ab2 |
14 | 20d3140d5 |
15 | 12cce2121 |
hex | b5dc798b |
3051125131 has 4 divisors (see below), whose sum is σ = 3056603472. Its totient is φ = 3045646792.
The previous prime is 3051125111. The next prime is 3051125137. The reversal of 3051125131 is 1315211503.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 3051125131 - 29 = 3051124619 is a prime.
It is a super-2 number, since 2×30511251312 = 18618729130039534322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3051125137) 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 3 ways as a sum of consecutive naturals, for example, 2738335 + ... + 2739448.
It is an arithmetic number, because the mean of its divisors is an integer number (764150868).
Almost surely, 23051125131 is an apocalyptic number.
3051125131 is a deficient number, since it is larger than the sum of its proper divisors (5478341).
3051125131 is an equidigital number, since it uses as much as digits as its factorization.
3051125131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5478340.
The product of its (nonzero) digits is 450, while the sum is 22.
The square root of 3051125131 is about 55236.9906041232. The cubic root of 3051125131 is about 1450.3962660121.
Adding to 3051125131 its reverse (1315211503), we get a palindrome (4366336634).
The spelling of 3051125131 in words is "three billion, fifty-one million, one hundred twenty-five thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.368 sec. • engine limits •