Base | Representation |
---|---|
bin | 1001001000000010… |
… | …1011001010100101 |
3 | 20022201110010112102 |
4 | 2102000223022211 |
5 | 20004102302331 |
6 | 1043024301445 |
7 | 114463453505 |
oct | 22200531245 |
9 | 6281403472 |
10 | 2449650341 |
11 | 1047844616 |
12 | 584471885 |
13 | 300680b58 |
14 | 1934a5a05 |
15 | e50d24cb |
hex | 9202b2a5 |
2449650341 has 2 divisors, whose sum is σ = 2449650342. Its totient is φ = 2449650340.
The previous prime is 2449650299. The next prime is 2449650391. The reversal of 2449650341 is 1430569442.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1338828100 + 1110822241 = 36590^2 + 33329^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2449650341 is a prime.
It is a super-2 number, since 2×24496503412 = 12001573586322832562, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2449650295 and 2449650304.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2449650391) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1224825170 + 1224825171.
It is an arithmetic number, because the mean of its divisors is an integer number (1224825171).
Almost surely, 22449650341 is an apocalyptic number.
It is an amenable number.
2449650341 is a deficient number, since it is larger than the sum of its proper divisors (1).
2449650341 is an equidigital number, since it uses as much as digits as its factorization.
2449650341 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 103680, while the sum is 38.
The square root of 2449650341 is about 49493.9424677404. The cubic root of 2449650341 is about 1348.0356141550.
The spelling of 2449650341 in words is "two billion, four hundred forty-nine million, six hundred fifty thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •