Base | Representation |
---|---|
bin | 101000000110011… |
… | …0101010100100101 |
3 | 10110202212120211011 |
4 | 1100030311110211 |
5 | 10223424311123 |
6 | 341303342221 |
7 | 45225625156 |
oct | 12014652445 |
9 | 3422776734 |
10 | 1345541413 |
11 | 6305831a7 |
12 | 316751971 |
13 | 1859c1b68 |
14 | ca9b792d |
15 | 7d1d8e0d |
hex | 50335525 |
1345541413 has 2 divisors, whose sum is σ = 1345541414. Its totient is φ = 1345541412.
The previous prime is 1345541399. The next prime is 1345541441. The reversal of 1345541413 is 3141455431.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 700025764 + 645515649 = 26458^2 + 25407^2 .
It is an emirp because it is prime and its reverse (3141455431) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1345541413 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1345541443) 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, 672770706 + 672770707.
It is an arithmetic number, because the mean of its divisors is an integer number (672770707).
Almost surely, 21345541413 is an apocalyptic number.
It is an amenable number.
1345541413 is a deficient number, since it is larger than the sum of its proper divisors (1).
1345541413 is an equidigital number, since it uses as much as digits as its factorization.
1345541413 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 14400, while the sum is 31.
The square root of 1345541413 is about 36681.6222787379. The cubic root of 1345541413 is about 1103.9913984159.
Adding to 1345541413 its reverse (3141455431), we get a palindrome (4486996844).
The spelling of 1345541413 in words is "one billion, three hundred forty-five million, five hundred forty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •