Base | Representation |
---|---|
bin | 1100000101001000… |
… | …0101111110101001 |
3 | 22100222210112221011 |
4 | 3001102011332221 |
5 | 23120120331034 |
6 | 1253435143521 |
7 | 143233612204 |
oct | 30122057651 |
9 | 8328715834 |
10 | 3242745769 |
11 | 141449998a |
12 | 765ba4ba1 |
13 | 3c8a870a3 |
14 | 22a95493b |
15 | 13ea43864 |
hex | c1485fa9 |
3242745769 has 4 divisors (see below), whose sum is σ = 3244315140. Its totient is φ = 3241176400.
The previous prime is 3242745761. The next prime is 3242745791. The reversal of 3242745769 is 9675472423.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 540097600 + 2702648169 = 23240^2 + 51987^2 .
It is a cyclic number.
It is not a de Polignac number, because 3242745769 - 23 = 3242745761 is a prime.
It is a super-2 number, since 2×32427457692 = 21030800244734802722, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (3242745761) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 781582 + ... + 785719.
It is an arithmetic number, because the mean of its divisors is an integer number (811078785).
Almost surely, 23242745769 is an apocalyptic number.
It is an amenable number.
3242745769 is a deficient number, since it is larger than the sum of its proper divisors (1569371).
3242745769 is a wasteful number, since it uses less digits than its factorization.
3242745769 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1569370.
The product of its digits is 2540160, while the sum is 49.
The square root of 3242745769 is about 56945.1118973350. Note that the first 3 decimals coincide. The cubic root of 3242745769 is about 1480.1451295774.
The spelling of 3242745769 in words is "three billion, two hundred forty-two million, seven hundred forty-five thousand, seven hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •