Base | Representation |
---|---|
bin | 101000010001110… |
… | …1000111100100111 |
3 | 10111012010022221202 |
4 | 1100203220330213 |
5 | 10231442120124 |
6 | 342035433115 |
7 | 45330505442 |
oct | 12043507447 |
9 | 3435108852 |
10 | 1351520039 |
11 | 633997011 |
12 | 31875579b |
13 | 1870061cc |
14 | cb6d2659 |
15 | 7d9ba5ae |
hex | 508e8f27 |
1351520039 has 2 divisors, whose sum is σ = 1351520040. Its totient is φ = 1351520038.
The previous prime is 1351519999. The next prime is 1351520041. The reversal of 1351520039 is 9300251531.
It is a strong prime.
It is an emirp because it is prime and its reverse (9300251531) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1351520039 - 28 = 1351519783 is a prime.
It is a Sophie Germain prime.
Together with 1351520041, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 1351519993 and 1351520020.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1351520069) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 675760019 + 675760020.
It is an arithmetic number, because the mean of its divisors is an integer number (675760020).
Almost surely, 21351520039 is an apocalyptic number.
1351520039 is a deficient number, since it is larger than the sum of its proper divisors (1).
1351520039 is an equidigital number, since it uses as much as digits as its factorization.
1351520039 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4050, while the sum is 29.
The square root of 1351520039 is about 36763.0254331713. The cubic root of 1351520039 is about 1105.6240993058.
The spelling of 1351520039 in words is "one billion, three hundred fifty-one million, five hundred twenty thousand, thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •