Base | Representation |
---|---|
bin | 100111001101100… |
… | …1001110110111101 |
3 | 10101200210120111111 |
4 | 1032123021312331 |
5 | 10143312203432 |
6 | 334320522021 |
7 | 44414420635 |
oct | 11633116675 |
9 | 3350716444 |
10 | 1315741117 |
11 | 615779859 |
12 | 308780311 |
13 | 17c789a52 |
14 | c6a5b6c5 |
15 | 7a79e347 |
hex | 4e6c9dbd |
1315741117 has 2 divisors, whose sum is σ = 1315741118. Its totient is φ = 1315741116.
The previous prime is 1315741087. The next prime is 1315741253. The reversal of 1315741117 is 7111475131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1260179001 + 55562116 = 35499^2 + 7454^2 .
It is an emirp because it is prime and its reverse (7111475131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1315741117 - 27 = 1315740989 is a prime.
It is a super-3 number, since 3×13157411173 (a number of 28 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1315748117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 657870558 + 657870559.
It is an arithmetic number, because the mean of its divisors is an integer number (657870559).
Almost surely, 21315741117 is an apocalyptic number.
It is an amenable number.
1315741117 is a deficient number, since it is larger than the sum of its proper divisors (1).
1315741117 is an equidigital number, since it uses as much as digits as its factorization.
1315741117 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2940, while the sum is 31.
The square root of 1315741117 is about 36273.1459484837. The cubic root of 1315741117 is about 1095.7802843903.
The spelling of 1315741117 in words is "one billion, three hundred fifteen million, seven hundred forty-one thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •