Base | Representation |
---|---|
bin | 100100110010010… |
… | …1000110111000001 |
3 | 10012000122000221221 |
4 | 1021210220313001 |
5 | 10011442410223 |
6 | 322252115041 |
7 | 42405504502 |
oct | 11144506701 |
9 | 3160560857 |
10 | 1234341313 |
11 | 583831997 |
12 | 2a5465a81 |
13 | 16895949a |
14 | b9d0cba9 |
15 | 73570b5d |
hex | 49928dc1 |
1234341313 has 2 divisors, whose sum is σ = 1234341314. Its totient is φ = 1234341312.
The previous prime is 1234341293. The next prime is 1234341323. The reversal of 1234341313 is 3131434321.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 708464689 + 525876624 = 26617^2 + 22932^2 .
It is an emirp because it is prime and its reverse (3131434321) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1234341313 - 29 = 1234340801 is a prime.
It is not a weakly prime, because it can be changed into another prime (1234341323) 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, 617170656 + 617170657.
It is an arithmetic number, because the mean of its divisors is an integer number (617170657).
Almost surely, 21234341313 is an apocalyptic number.
It is an amenable number.
1234341313 is a deficient number, since it is larger than the sum of its proper divisors (1).
1234341313 is an equidigital number, since it uses as much as digits as its factorization.
1234341313 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2592, while the sum is 25.
The square root of 1234341313 is about 35133.1938912476. The cubic root of 1234341313 is about 1072.7003483190.
Adding to 1234341313 its reverse (3131434321), we get a palindrome (4365775634).
The spelling of 1234341313 in words is "one billion, two hundred thirty-four million, three hundred forty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •