Base | Representation |
---|---|
bin | 1011010101110110… |
… | …0011111100010101 |
3 | 21212011121211122202 |
4 | 2311131203330111 |
5 | 22213333103433 |
6 | 1222032334245 |
7 | 135305122034 |
oct | 26535437425 |
9 | 7764554582 |
10 | 3044425493 |
11 | 1322553a2a |
12 | 70b6a4385 |
13 | 39696a505 |
14 | 20c48c71b |
15 | 12c41bee8 |
hex | b5763f15 |
3044425493 has 2 divisors, whose sum is σ = 3044425494. Its totient is φ = 3044425492.
The previous prime is 3044425457. The next prime is 3044425513. The reversal of 3044425493 is 3945244403.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1868141284 + 1176284209 = 43222^2 + 34297^2 .
It is a cyclic number.
It is not a de Polignac number, because 3044425493 - 216 = 3044359957 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3044125493) 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 as a sum of consecutive naturals, namely, 1522212746 + 1522212747.
It is an arithmetic number, because the mean of its divisors is an integer number (1522212747).
Almost surely, 23044425493 is an apocalyptic number.
It is an amenable number.
3044425493 is a deficient number, since it is larger than the sum of its proper divisors (1).
3044425493 is an equidigital number, since it uses as much as digits as its factorization.
3044425493 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 207360, while the sum is 38.
The square root of 3044425493 is about 55176.3127890946. The cubic root of 3044425493 is about 1449.3338982540. Note that the first 3 decimals are identical.
Adding to 3044425493 its reverse (3945244403), we get a palindrome (6989669896).
The spelling of 3044425493 in words is "three billion, forty-four million, four hundred twenty-five thousand, four hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •