Base | Representation |
---|---|
bin | 1011101011001101… |
… | …1111011110011001 |
3 | 22002102021202200122 |
4 | 2322303133132121 |
5 | 22404304413231 |
6 | 1234553443025 |
7 | 140444034311 |
oct | 27263373631 |
9 | 8072252618 |
10 | 3134060441 |
11 | 1369105aa6 |
12 | 735710475 |
13 | 3ac3c2245 |
14 | 21a342441 |
15 | 13522577b |
hex | bacdf799 |
3134060441 has 2 divisors, whose sum is σ = 3134060442. Its totient is φ = 3134060440.
The previous prime is 3134060359. The next prime is 3134060453. The reversal of 3134060441 is 1440604313.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1794793225 + 1339267216 = 42365^2 + 36596^2 .
It is a cyclic number.
It is not a de Polignac number, because 3134060441 - 210 = 3134059417 is a prime.
It is a super-2 number, since 2×31340604412 = 19644669695682228962, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 3134060441.
It is not a weakly prime, because it can be changed into another prime (3134060341) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1567030220 + 1567030221.
It is an arithmetic number, because the mean of its divisors is an integer number (1567030221).
Almost surely, 23134060441 is an apocalyptic number.
It is an amenable number.
3134060441 is a deficient number, since it is larger than the sum of its proper divisors (1).
3134060441 is an equidigital number, since it uses as much as digits as its factorization.
3134060441 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3456, while the sum is 26.
The square root of 3134060441 is about 55982.6798304618. The cubic root of 3134060441 is about 1463.4204599004.
Adding to 3134060441 its reverse (1440604313), we get a palindrome (4574664754).
The spelling of 3134060441 in words is "three billion, one hundred thirty-four million, sixty thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •