Base | Representation |
---|---|
bin | 100001011110110… |
… | …0011111101001001 |
3 | 2220021221101011021 |
4 | 1002331203331021 |
5 | 4300044344223 |
6 | 303251032441 |
7 | 36561014461 |
oct | 10275437511 |
9 | 2807841137 |
10 | 1123434313 |
11 | 527170911 |
12 | 27429b721 |
13 | 14b997341 |
14 | a92bcba1 |
15 | 6896465d |
hex | 42f63f49 |
1123434313 has 2 divisors, whose sum is σ = 1123434314. Its totient is φ = 1123434312.
The previous prime is 1123434271. The next prime is 1123434331. The reversal of 1123434313 is 3134343211.
Together with next prime (1123434331) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1041223824 + 82210489 = 32268^2 + 9067^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1123434313 is a prime.
It is not a weakly prime, because it can be changed into another prime (1123434353) 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, 561717156 + 561717157.
It is an arithmetic number, because the mean of its divisors is an integer number (561717157).
Almost surely, 21123434313 is an apocalyptic number.
It is an amenable number.
1123434313 is a deficient number, since it is larger than the sum of its proper divisors (1).
1123434313 is an equidigital number, since it uses as much as digits as its factorization.
1123434313 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 1123434313 is about 33517.6716524284. The cubic root of 1123434313 is about 1039.5592045327.
Adding to 1123434313 its reverse (3134343211), we get a palindrome (4257777524).
The spelling of 1123434313 in words is "one billion, one hundred twenty-three million, four hundred thirty-four thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •