Base | Representation |
---|---|
bin | 10011101111001010111… |
… | …001011011001001011001 |
3 | 11210122220012000100022212 |
4 | 103233022321123021121 |
5 | 134210220044434043 |
6 | 2515030105524505 |
7 | 166663562101565 |
oct | 23571271331131 |
9 | 4718805010285 |
10 | 1356318749273 |
11 | 483236636084 |
12 | 19aa444a3735 |
13 | 9ab91c96a57 |
14 | 4990917c6a5 |
15 | 254333b7018 |
hex | 13bcae5b259 |
1356318749273 has 2 divisors, whose sum is σ = 1356318749274. Its totient is φ = 1356318749272.
The previous prime is 1356318749237. The next prime is 1356318749321. The reversal of 1356318749273 is 3729478136531.
Together with previous prime (1356318749237) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1303828273609 + 52490475664 = 1141853^2 + 229108^2 .
It is a cyclic number.
It is not a de Polignac number, because 1356318749273 - 28 = 1356318749017 is a prime.
It is not a weakly prime, because it can be changed into another prime (1356318745273) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 678159374636 + 678159374637.
It is an arithmetic number, because the mean of its divisors is an integer number (678159374637).
Almost surely, 21356318749273 is an apocalyptic number.
It is an amenable number.
1356318749273 is a deficient number, since it is larger than the sum of its proper divisors (1).
1356318749273 is an equidigital number, since it uses as much as digits as its factorization.
1356318749273 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 22861440, while the sum is 59.
The spelling of 1356318749273 in words is "one trillion, three hundred fifty-six billion, three hundred eighteen million, seven hundred forty-nine thousand, two hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •