Base | Representation |
---|---|
bin | 1011001110001100… |
… | …1010101101110001 |
3 | 21202221020202110010 |
4 | 2303203022231301 |
5 | 22132124344333 |
6 | 1214524525133 |
7 | 134435321043 |
oct | 26343125561 |
9 | 7687222403 |
10 | 3012340593 |
11 | 130642a089 |
12 | 7009b07a9 |
13 | 390115572 |
14 | 2080d9a93 |
15 | 1296d0563 |
hex | b38cab71 |
3012340593 has 8 divisors (see below), whose sum is σ = 4036843008. Its totient is φ = 1998032624.
The previous prime is 3012340589. The next prime is 3012340609. The reversal of 3012340593 is 3950432103.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 3012340593 - 22 = 3012340589 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 3012340593.
It is not an unprimeable number, because it can be changed into a prime (3012340193) 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 in 7 ways as a sum of consecutive naturals, for example, 2547921 + ... + 2549102.
It is an arithmetic number, because the mean of its divisors is an integer number (504605376).
Almost surely, 23012340593 is an apocalyptic number.
It is an amenable number.
3012340593 is a deficient number, since it is larger than the sum of its proper divisors (1024502415).
3012340593 is a wasteful number, since it uses less digits than its factorization.
3012340593 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5097223.
The product of its (nonzero) digits is 9720, while the sum is 30.
The square root of 3012340593 is about 54884.7938230618. The cubic root of 3012340593 is about 1444.2244443149.
Adding to 3012340593 its reverse (3950432103), we get a palindrome (6962772696).
The spelling of 3012340593 in words is "three billion, twelve million, three hundred forty thousand, five hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •