Base | Representation |
---|---|
bin | 1111110001100111… |
… | …1101010010001001 |
3 | 101221010021011122012 |
4 | 3330121331102021 |
5 | 32133033204144 |
6 | 1540111305305 |
7 | 206640020261 |
oct | 37431752211 |
9 | 11833234565 |
10 | 4234663049 |
11 | 18833a2031 |
12 | 9a221b235 |
13 | 5264242a6 |
14 | 2c259a7a1 |
15 | 19bb79e9e |
hex | fc67d489 |
4234663049 has 2 divisors, whose sum is σ = 4234663050. Its totient is φ = 4234663048.
The previous prime is 4234663031. The next prime is 4234663051. The reversal of 4234663049 is 9403664324.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3364000000 + 870663049 = 58000^2 + 29507^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4234663049 is a prime.
It is a super-2 number, since 2×42346630492 = 35864742277131952802, which contains 22 as substring.
Together with 4234663051, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 4234662997 and 4234663015.
It is not a weakly prime, because it can be changed into another prime (4234663079) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2117331524 + 2117331525.
It is an arithmetic number, because the mean of its divisors is an integer number (2117331525).
Almost surely, 24234663049 is an apocalyptic number.
It is an amenable number.
4234663049 is a deficient number, since it is larger than the sum of its proper divisors (1).
4234663049 is an equidigital number, since it uses as much as digits as its factorization.
4234663049 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 373248, while the sum is 41.
The square root of 4234663049 is about 65074.2886937691. The cubic root of 4234663049 is about 1617.8550906590.
The spelling of 4234663049 in words is "four billion, two hundred thirty-four million, six hundred sixty-three thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •