Base | Representation |
---|---|
bin | 10011101001111101100… |
… | …101001110000110011111 |
3 | 11210010110110110202120202 |
4 | 103221331211032012133 |
5 | 134112242004440111 |
6 | 2512303143334115 |
7 | 166405160001236 |
oct | 23517545160637 |
9 | 4703413422522 |
10 | 1350726640031 |
11 | 480926a7a69a |
12 | 19994375133b |
13 | 9a4b0573082 |
14 | 495385c9b1d |
15 | 252074a0b3b |
hex | 13a7d94e19f |
1350726640031 has 2 divisors, whose sum is σ = 1350726640032. Its totient is φ = 1350726640030.
The previous prime is 1350726640013. The next prime is 1350726640033. The reversal of 1350726640031 is 1300466270531.
Together with previous prime (1350726640013) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is an emirp because it is prime and its reverse (1300466270531) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1350726640031 - 214 = 1350726623647 is a prime.
It is a super-2 number, since 2×13507266400312 (a number of 25 digits) contains 22 as substring.
Together with 1350726640033, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1350726640033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 675363320015 + 675363320016.
It is an arithmetic number, because the mean of its divisors is an integer number (675363320016).
Almost surely, 21350726640031 is an apocalyptic number.
1350726640031 is a deficient number, since it is larger than the sum of its proper divisors (1).
1350726640031 is an equidigital number, since it uses as much as digits as its factorization.
1350726640031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 90720, while the sum is 38.
The spelling of 1350726640031 in words is "one trillion, three hundred fifty billion, seven hundred twenty-six million, six hundred forty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •