Base | Representation |
---|---|
bin | 1100010100011110… |
… | …1111010101110101 |
3 | 22112110222010212001 |
4 | 3011013233111311 |
5 | 23233111443334 |
6 | 1304055255301 |
7 | 144645141643 |
oct | 30507572565 |
9 | 8473863761 |
10 | 3307140469 |
11 | 1447881646 |
12 | 78367a531 |
13 | 409212469 |
14 | 235318193 |
15 | 145513714 |
hex | c51ef575 |
3307140469 has 2 divisors, whose sum is σ = 3307140470. Its totient is φ = 3307140468.
The previous prime is 3307140467. The next prime is 3307140493. The reversal of 3307140469 is 9640417033.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2058436900 + 1248703569 = 45370^2 + 35337^2 .
It is a cyclic number.
It is not a de Polignac number, because 3307140469 - 21 = 3307140467 is a prime.
It is a super-2 number, since 2×33071404692 = 21874356163395079922, which contains 22 as substring.
Together with 3307140467, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3307140467) 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, 1653570234 + 1653570235.
It is an arithmetic number, because the mean of its divisors is an integer number (1653570235).
Almost surely, 23307140469 is an apocalyptic number.
It is an amenable number.
3307140469 is a deficient number, since it is larger than the sum of its proper divisors (1).
3307140469 is an equidigital number, since it uses as much as digits as its factorization.
3307140469 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54432, while the sum is 37.
The square root of 3307140469 is about 57507.7426873982. The cubic root of 3307140469 is about 1489.8785945253.
The spelling of 3307140469 in words is "three billion, three hundred seven million, one hundred forty thousand, four hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •