Base | Representation |
---|---|
bin | 1011010110000100… |
… | …0100010101010001 |
3 | 21212020100112102111 |
4 | 2311201010111101 |
5 | 22214102011333 |
6 | 1222104145321 |
7 | 135316000444 |
oct | 26541042521 |
9 | 7766315374 |
10 | 3045344593 |
11 | 1323021515 |
12 | 70ba68241 |
13 | 396bcc965 |
14 | 20c64b65b |
15 | 12c54e4cd |
hex | b5844551 |
3045344593 has 2 divisors, whose sum is σ = 3045344594. Its totient is φ = 3045344592.
The previous prime is 3045344537. The next prime is 3045344611. The reversal of 3045344593 is 3954435403.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1952579344 + 1092765249 = 44188^2 + 33057^2 .
It is a cyclic number.
It is not a de Polignac number, because 3045344593 - 225 = 3011790161 is a prime.
It is a super-2 number, since 2×30453445932 = 18548247380228671298, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3045342593) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1522672296 + 1522672297.
It is an arithmetic number, because the mean of its divisors is an integer number (1522672297).
Almost surely, 23045344593 is an apocalyptic number.
It is an amenable number.
3045344593 is a deficient number, since it is larger than the sum of its proper divisors (1).
3045344593 is an equidigital number, since it uses as much as digits as its factorization.
3045344593 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 388800, while the sum is 40.
The square root of 3045344593 is about 55184.6409157476. The cubic root of 3045344593 is about 1449.4797329675.
Adding to 3045344593 its reverse (3954435403), we get a palindrome (6999779996).
The spelling of 3045344593 in words is "three billion, forty-five million, three hundred forty-four thousand, five hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •