Base | Representation |
---|---|
bin | 101000010001001… |
… | …1100000011111001 |
3 | 10111011112022221211 |
4 | 1100202130003321 |
5 | 10231402030423 |
6 | 342025003121 |
7 | 45325024336 |
oct | 12042340371 |
9 | 3434468854 |
10 | 1351205113 |
11 | 6337a1445 |
12 | 3186234a1 |
13 | 186c25a6b |
14 | cb64d98d |
15 | 7d95710d |
hex | 5089c0f9 |
1351205113 has 2 divisors, whose sum is σ = 1351205114. Its totient is φ = 1351205112.
The previous prime is 1351205099. The next prime is 1351205117. The reversal of 1351205113 is 3115021531.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1325833744 + 25371369 = 36412^2 + 5037^2 .
It is an emirp because it is prime and its reverse (3115021531) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1351205113 - 29 = 1351204601 is a prime.
It is not a weakly prime, because it can be changed into another prime (1351205117) 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, 675602556 + 675602557.
It is an arithmetic number, because the mean of its divisors is an integer number (675602557).
Almost surely, 21351205113 is an apocalyptic number.
It is an amenable number.
1351205113 is a deficient number, since it is larger than the sum of its proper divisors (1).
1351205113 is an equidigital number, since it uses as much as digits as its factorization.
1351205113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 450, while the sum is 22.
The square root of 1351205113 is about 36758.7419942522. The cubic root of 1351205113 is about 1105.5382165434.
Adding to 1351205113 its reverse (3115021531), we get a palindrome (4466226644).
The spelling of 1351205113 in words is "one billion, three hundred fifty-one million, two hundred five thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •