Base | Representation |
---|---|
bin | 11101010010111… |
… | …10010000010001 |
3 | 122010102112112101 |
4 | 32221132100101 |
5 | 1000403042344 |
6 | 40215200401 |
7 | 6042602416 |
oct | 1651362021 |
9 | 563375471 |
10 | 245752849 |
11 | 1167a2831 |
12 | 6a376101 |
13 | 3bbb64b4 |
14 | 248d210d |
15 | 168959d4 |
hex | ea5e411 |
245752849 has 2 divisors, whose sum is σ = 245752850. Its totient is φ = 245752848.
The previous prime is 245752847. The next prime is 245752879. The reversal of 245752849 is 948257542.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 131262849 + 114490000 = 11457^2 + 10700^2 .
It is a cyclic number.
It is not a de Polignac number, because 245752849 - 21 = 245752847 is a prime.
It is a super-3 number, since 3×2457528493 (a number of 26 digits) contains 333 as substring.
Together with 245752847, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 245752799 and 245752808.
It is not a weakly prime, because it can be changed into another prime (245752847) 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, 122876424 + 122876425.
It is an arithmetic number, because the mean of its divisors is an integer number (122876425).
Almost surely, 2245752849 is an apocalyptic number.
It is an amenable number.
245752849 is a deficient number, since it is larger than the sum of its proper divisors (1).
245752849 is an equidigital number, since it uses as much as digits as its factorization.
245752849 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 806400, while the sum is 46.
The square root of 245752849 is about 15676.5062753153. The cubic root of 245752849 is about 626.3727471769.
The spelling of 245752849 in words is "two hundred forty-five million, seven hundred fifty-two thousand, eight hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •