Base | Representation |
---|---|
bin | 10011000101011011100… |
… | …111100001010110011001 |
3 | 11122101012211121021211222 |
4 | 103011123213201112121 |
5 | 132441424020042103 |
6 | 2442255025501425 |
7 | 163516150006142 |
oct | 23053347412631 |
9 | 4571184537758 |
10 | 1311502112153 |
11 | 46622882a302 |
12 | 1922174a1875 |
13 | 9689c06636c |
14 | 47697000ac9 |
15 | 241adae8638 |
hex | 1315b9e1599 |
1311502112153 has 2 divisors, whose sum is σ = 1311502112154. Its totient is φ = 1311502112152.
The previous prime is 1311502112131. The next prime is 1311502112159. The reversal of 1311502112153 is 3512112051131.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 846394480009 + 465107632144 = 919997^2 + 681988^2 .
It is an emirp because it is prime and its reverse (3512112051131) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1311502112153 - 28 = 1311502111897 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1311502112159) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 655751056076 + 655751056077.
It is an arithmetic number, because the mean of its divisors is an integer number (655751056077).
Almost surely, 21311502112153 is an apocalyptic number.
It is an amenable number.
1311502112153 is a deficient number, since it is larger than the sum of its proper divisors (1).
1311502112153 is an equidigital number, since it uses as much as digits as its factorization.
1311502112153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 900, while the sum is 26.
Adding to 1311502112153 its reverse (3512112051131), we get a palindrome (4823614163284).
The spelling of 1311502112153 in words is "one trillion, three hundred eleven billion, five hundred two million, one hundred twelve thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •