Base | Representation |
---|---|
bin | 1100010001100010… |
… | …1010010011001001 |
3 | 22111121202010121102 |
4 | 3010120222103021 |
5 | 23221432032144 |
6 | 1302534551145 |
7 | 144435221063 |
oct | 30430522311 |
9 | 8447663542 |
10 | 3294799049 |
11 | 1440912323 |
12 | 77b5084b5 |
13 | 4067b0c49 |
14 | 233824733 |
15 | 1443c6b4e |
hex | c462a4c9 |
3294799049 has 2 divisors, whose sum is σ = 3294799050. Its totient is φ = 3294799048.
The previous prime is 3294799037. The next prime is 3294799093. The reversal of 3294799049 is 9409974923.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3118440649 + 176358400 = 55843^2 + 13280^2 .
It is an emirp because it is prime and its reverse (9409974923) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3294799049 - 212 = 3294794953 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3294798985 and 3294799003.
It is not a weakly prime, because it can be changed into another prime (3294799349) 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, 1647399524 + 1647399525.
It is an arithmetic number, because the mean of its divisors is an integer number (1647399525).
Almost surely, 23294799049 is an apocalyptic number.
It is an amenable number.
3294799049 is a deficient number, since it is larger than the sum of its proper divisors (1).
3294799049 is an equidigital number, since it uses as much as digits as its factorization.
3294799049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4408992, while the sum is 56.
The square root of 3294799049 is about 57400.3401470758. The cubic root of 3294799049 is about 1488.0229998047.
The spelling of 3294799049 in words is "three billion, two hundred ninety-four million, seven hundred ninety-nine thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •