Base | Representation |
---|---|
bin | 101000010001000… |
… | …0110000101111011 |
3 | 10111011100202112011 |
4 | 1100202012011323 |
5 | 10231341141011 |
6 | 342023030351 |
7 | 45324201112 |
oct | 12042060573 |
9 | 3434322464 |
10 | 1351115131 |
11 | 63373a883 |
12 | 31859b3b7 |
13 | 186bc3b12 |
14 | cb628c79 |
15 | 7d93a621 |
hex | 5088617b |
1351115131 has 2 divisors, whose sum is σ = 1351115132. Its totient is φ = 1351115130.
The previous prime is 1351115113. The next prime is 1351115201. The reversal of 1351115131 is 1315111531.
Together with previous prime (1351115113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1351115131 - 229 = 814244219 is a prime.
It is a super-2 number, since 2×13511151312 = 3651024194434294322, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1351115431) 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, 675557565 + 675557566.
It is an arithmetic number, because the mean of its divisors is an integer number (675557566).
Almost surely, 21351115131 is an apocalyptic number.
1351115131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1351115131 is an equidigital number, since it uses as much as digits as its factorization.
1351115131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 225, while the sum is 22.
The square root of 1351115131 is about 36757.5180201275. The cubic root of 1351115131 is about 1105.5136753031.
Adding to 1351115131 its reverse (1315111531), we get a palindrome (2666226662).
The spelling of 1351115131 in words is "one billion, three hundred fifty-one million, one hundred fifteen thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.026 sec. • engine limits •