Base | Representation |
---|---|
bin | 1011101010110010… |
… | …0100010101011101 |
3 | 22002021212112211201 |
4 | 2322230210111131 |
5 | 22403323322331 |
6 | 1234450515501 |
7 | 140422434421 |
oct | 27254442535 |
9 | 8067775751 |
10 | 3132245341 |
11 | 1368086315 |
12 | 734b95b91 |
13 | 3abc08014 |
14 | 219dccb81 |
15 | 134eb7a61 |
hex | bab2455d |
3132245341 has 2 divisors, whose sum is σ = 3132245342. Its totient is φ = 3132245340.
The previous prime is 3132245339. The next prime is 3132245411. The reversal of 3132245341 is 1435422313.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3127605625 + 4639716 = 55925^2 + 2154^2 .
It is a cyclic number.
It is not a de Polignac number, because 3132245341 - 21 = 3132245339 is a prime.
Together with 3132245339, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3132242341) 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 as a sum of consecutive naturals, namely, 1566122670 + 1566122671.
It is an arithmetic number, because the mean of its divisors is an integer number (1566122671).
Almost surely, 23132245341 is an apocalyptic number.
It is an amenable number.
3132245341 is a deficient number, since it is larger than the sum of its proper divisors (1).
3132245341 is an equidigital number, since it uses as much as digits as its factorization.
3132245341 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 8640, while the sum is 28.
The square root of 3132245341 is about 55966.4662186206. The cubic root of 3132245341 is about 1463.1378906387.
Adding to 3132245341 its reverse (1435422313), we get a palindrome (4567667654).
The spelling of 3132245341 in words is "three billion, one hundred thirty-two million, two hundred forty-five thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •