Base | Representation |
---|---|
bin | 101000001110100… |
… | …0111100100011101 |
3 | 10111001220110212001 |
4 | 1100131013210131 |
5 | 10231022413321 |
6 | 341535042301 |
7 | 45310125316 |
oct | 12035074435 |
9 | 3431813761 |
10 | 1349810461 |
11 | 632a2963a |
12 | 318070391 |
13 | 18685801c |
14 | cb3a960d |
15 | 7d77dc91 |
hex | 5074791d |
1349810461 has 2 divisors, whose sum is σ = 1349810462. Its totient is φ = 1349810460.
The previous prime is 1349810459. The next prime is 1349810467. The reversal of 1349810461 is 1640189431.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 825125625 + 524684836 = 28725^2 + 22906^2 .
It is a cyclic number.
It is not a de Polignac number, because 1349810461 - 21 = 1349810459 is a prime.
Together with 1349810459, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 1349810461.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1349810467) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 674905230 + 674905231.
It is an arithmetic number, because the mean of its divisors is an integer number (674905231).
Almost surely, 21349810461 is an apocalyptic number.
It is an amenable number.
1349810461 is a deficient number, since it is larger than the sum of its proper divisors (1).
1349810461 is an equidigital number, since it uses as much as digits as its factorization.
1349810461 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20736, while the sum is 37.
The square root of 1349810461 is about 36739.7667521175. The cubic root of 1349810461 is about 1105.1577236419.
Adding to 1349810461 its reverse (1640189431), we get a palindrome (2989999892).
The spelling of 1349810461 in words is "one billion, three hundred forty-nine million, eight hundred ten thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •