Base | Representation |
---|---|
bin | 1000111110100000… |
… | …1101000110111101 |
3 | 20012221020111101002 |
4 | 2033220031012331 |
5 | 14413334300331 |
6 | 1035035500045 |
7 | 113466645014 |
oct | 21750150675 |
9 | 6187214332 |
10 | 2409681341 |
11 | 1027225291 |
12 | 572bb7625 |
13 | 2c52c8462 |
14 | 18c05da7b |
15 | e18399cb |
hex | 8fa0d1bd |
2409681341 has 2 divisors, whose sum is σ = 2409681342. Its totient is φ = 2409681340.
The previous prime is 2409681299. The next prime is 2409681359. The reversal of 2409681341 is 1431869042.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1683378841 + 726302500 = 41029^2 + 26950^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2409681341 is a prime.
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 = 2409681295 and 2409681304.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2409681041) 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, 1204840670 + 1204840671.
It is an arithmetic number, because the mean of its divisors is an integer number (1204840671).
Almost surely, 22409681341 is an apocalyptic number.
It is an amenable number.
2409681341 is a deficient number, since it is larger than the sum of its proper divisors (1).
2409681341 is an equidigital number, since it uses as much as digits as its factorization.
2409681341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 41472, while the sum is 38.
The square root of 2409681341 is about 49088.5051819670. The cubic root of 2409681341 is about 1340.6637650478.
The spelling of 2409681341 in words is "two billion, four hundred nine million, six hundred eighty-one thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •