Base | Representation |
---|---|
bin | 11011111011100… |
… | …010010110110001 |
3 | 1012122201221110002 |
4 | 123323202112301 |
5 | 1424424421144 |
6 | 114255315345 |
7 | 14416652402 |
oct | 3373422661 |
9 | 1178657402 |
10 | 468592049 |
11 | 220565162 |
12 | 110b1bb55 |
13 | 76109303 |
14 | 4633b9a9 |
15 | 2b21214e |
hex | 1bee25b1 |
468592049 has 2 divisors, whose sum is σ = 468592050. Its totient is φ = 468592048.
The previous prime is 468592043. The next prime is 468592051. The reversal of 468592049 is 940295864.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 438693025 + 29899024 = 20945^2 + 5468^2 .
It is a cyclic number.
It is not a de Polignac number, because 468592049 - 28 = 468591793 is a prime.
It is a Sophie Germain prime.
Together with 468592051, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 468591994 and 468592012.
It is not a weakly prime, because it can be changed into another prime (468592043) 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 as a sum of consecutive naturals, namely, 234296024 + 234296025.
It is an arithmetic number, because the mean of its divisors is an integer number (234296025).
Almost surely, 2468592049 is an apocalyptic number.
It is an amenable number.
468592049 is a deficient number, since it is larger than the sum of its proper divisors (1).
468592049 is an equidigital number, since it uses as much as digits as its factorization.
468592049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 622080, while the sum is 47.
The square root of 468592049 is about 21646.9870651784. The cubic root of 468592049 is about 776.7208650453.
The spelling of 468592049 in words is "four hundred sixty-eight million, five hundred ninety-two thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •