Base | Representation |
---|---|
bin | 100111001100110… |
… | …1010011001110101 |
3 | 10101200001201011121 |
4 | 1032121222121311 |
5 | 10143212201013 |
6 | 334304303541 |
7 | 44411202016 |
oct | 11631523165 |
9 | 3350051147 |
10 | 1315350133 |
11 | 615532029 |
12 | 308611bb1 |
13 | 17c680ab6 |
14 | c699900d |
15 | 7a72358d |
hex | 4e66a675 |
1315350133 has 2 divisors, whose sum is σ = 1315350134. Its totient is φ = 1315350132.
The previous prime is 1315350073. The next prime is 1315350143. The reversal of 1315350133 is 3310535131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1251956689 + 63393444 = 35383^2 + 7962^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1315350133 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1315350098 and 1315350107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1315350143) 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, 657675066 + 657675067.
It is an arithmetic number, because the mean of its divisors is an integer number (657675067).
Almost surely, 21315350133 is an apocalyptic number.
It is an amenable number.
1315350133 is a deficient number, since it is larger than the sum of its proper divisors (1).
1315350133 is an equidigital number, since it uses as much as digits as its factorization.
1315350133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2025, while the sum is 25.
The square root of 1315350133 is about 36267.7561064922. The cubic root of 1315350133 is about 1095.6717334001.
Adding to 1315350133 its reverse (3310535131), we get a palindrome (4625885264).
The spelling of 1315350133 in words is "one billion, three hundred fifteen million, three hundred fifty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •