Base | Representation |
---|---|
bin | 1011010010101011… |
… | …0011111000011111 |
3 | 21211020120220221000 |
4 | 2310222303320133 |
5 | 22201431341224 |
6 | 1220435241343 |
7 | 135054051513 |
oct | 26452637037 |
9 | 7736526830 |
10 | 3031121439 |
11 | 1315a97445 |
12 | 707149253 |
13 | 393c8caa8 |
14 | 20a7c8143 |
15 | 12b1900c9 |
hex | b4ab3e1f |
3031121439 has 8 divisors (see below), whose sum is σ = 4490550320. Its totient is φ = 2020747608.
The previous prime is 3031121417. The next prime is 3031121477. The reversal of 3031121439 is 9341211303.
It is not a de Polignac number, because 3031121439 - 27 = 3031121311 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 112263757 = 3031121439 / (3 + 0 + 3 + 1 + 1 + 2 + 1 + 4 + 3 + 9).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (3031121939) 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, 56131852 + ... + 56131905.
It is an arithmetic number, because the mean of its divisors is an integer number (561318790).
Almost surely, 23031121439 is an apocalyptic number.
3031121439 is a deficient number, since it is larger than the sum of its proper divisors (1459428881).
3031121439 is a wasteful number, since it uses less digits than its factorization.
3031121439 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112263766 (or 112263760 counting only the distinct ones).
The product of its (nonzero) digits is 1944, while the sum is 27.
The square root of 3031121439 is about 55055.6213206245. The cubic root of 3031121439 is about 1447.2196326704.
The spelling of 3031121439 in words is "three billion, thirty-one million, one hundred twenty-one thousand, four hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •