Base | Representation |
---|---|
bin | 1011110010101001… |
… | …1100110001001101 |
3 | 22011120222002011112 |
4 | 2330222130301031 |
5 | 22440300310433 |
6 | 1242030101405 |
7 | 141303064025 |
oct | 27452346115 |
9 | 8146862145 |
10 | 3165244493 |
11 | 1384775044 |
12 | 74404a865 |
13 | 3b59c0148 |
14 | 22053ca85 |
15 | 137d35348 |
hex | bca9cc4d |
3165244493 has 2 divisors, whose sum is σ = 3165244494. Its totient is φ = 3165244492.
The previous prime is 3165244451. The next prime is 3165244541. The reversal of 3165244493 is 3944425613.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2985201769 + 180042724 = 54637^2 + 13418^2 .
It is a cyclic number.
It is not a de Polignac number, because 3165244493 - 210 = 3165243469 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 3165244493.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3165244193) 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, 1582622246 + 1582622247.
It is an arithmetic number, because the mean of its divisors is an integer number (1582622247).
Almost surely, 23165244493 is an apocalyptic number.
It is an amenable number.
3165244493 is a deficient number, since it is larger than the sum of its proper divisors (1).
3165244493 is an equidigital number, since it uses as much as digits as its factorization.
3165244493 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 311040, while the sum is 41.
The square root of 3165244493 is about 56260.5056233945. The cubic root of 3165244493 is about 1468.2581514159.
The spelling of 3165244493 in words is "three billion, one hundred sixty-five million, two hundred forty-four thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •