Base | Representation |
---|---|
bin | 111111010001000… |
… | …110101001111001 |
3 | 2201222022011100111 |
4 | 333101012221321 |
5 | 4133212321223 |
6 | 253154304321 |
7 | 35206106332 |
oct | 7721065171 |
9 | 2658264314 |
10 | 1061448313 |
11 | 4a5183912 |
12 | 2575880a1 |
13 | 13bba3433 |
14 | a0d85289 |
15 | 632bd30d |
hex | 3f446a79 |
1061448313 has 2 divisors, whose sum is σ = 1061448314. Its totient is φ = 1061448312.
The previous prime is 1061448307. The next prime is 1061448317. The reversal of 1061448313 is 3138441601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 992691049 + 68757264 = 31507^2 + 8292^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1061448313 is a prime.
It is a super-2 number, since 2×10614483132 = 2253345042341091938, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1061448317) 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, 530724156 + 530724157.
It is an arithmetic number, because the mean of its divisors is an integer number (530724157).
Almost surely, 21061448313 is an apocalyptic number.
It is an amenable number.
1061448313 is a deficient number, since it is larger than the sum of its proper divisors (1).
1061448313 is an equidigital number, since it uses as much as digits as its factorization.
1061448313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6912, while the sum is 31.
The square root of 1061448313 is about 32579.8758898802. The cubic root of 1061448313 is about 1020.0769879734.
Adding to 1061448313 its reverse (3138441601), we get a palindrome (4199889914).
The spelling of 1061448313 in words is "one billion, sixty-one million, four hundred forty-eight thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •