Base | Representation |
---|---|
bin | 101001010111100… |
… | …0011001001010001 |
3 | 10120201220000201012 |
4 | 1102233003021101 |
5 | 10320321042421 |
6 | 345423020305 |
7 | 46253234534 |
oct | 12257031121 |
9 | 3521800635 |
10 | 1388065361 |
11 | 652588061 |
12 | 328a3a695 |
13 | 191760467 |
14 | d24c6a1b |
15 | 81cd895b |
hex | 52bc3251 |
1388065361 has 2 divisors, whose sum is σ = 1388065362. Its totient is φ = 1388065360.
The previous prime is 1388065339. The next prime is 1388065363. The reversal of 1388065361 is 1635608831.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 694059025 + 694006336 = 26345^2 + 26344^2 .
It is an emirp because it is prime and its reverse (1635608831) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1388065361 - 26 = 1388065297 is a prime.
It is a Sophie Germain prime.
Together with 1388065363, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1388065363) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 694032680 + 694032681.
It is an arithmetic number, because the mean of its divisors is an integer number (694032681).
Almost surely, 21388065361 is an apocalyptic number.
1388065361 is the 26345-th centered square number.
It is an amenable number.
1388065361 is a deficient number, since it is larger than the sum of its proper divisors (1).
1388065361 is an equidigital number, since it uses as much as digits as its factorization.
1388065361 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 103680, while the sum is 41.
The square root of 1388065361 is about 37256.7492006482. The cubic root of 1388065361 is about 1115.5010211895.
The spelling of 1388065361 in words is "one billion, three hundred eighty-eight million, sixty-five thousand, three hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •