Base | Representation |
---|---|
bin | 1100000110110011111000… |
… | …0001011011111100011101 |
3 | 1202010112101112020022002102 |
4 | 3001230332001123330131 |
5 | 3221042210404324201 |
6 | 44151015532534445 |
7 | 2542461363651533 |
oct | 301547601337435 |
9 | 52115345208072 |
10 | 13311144214301 |
11 | 427225198515a |
12 | 15ab957321425 |
13 | 75730a565c6b |
14 | 340397258153 |
15 | 1813c03c026b |
hex | c1b3e05bf1d |
13311144214301 has 2 divisors, whose sum is σ = 13311144214302. Its totient is φ = 13311144214300.
The previous prime is 13311144214261. The next prime is 13311144214363. The reversal of 13311144214301 is 10341244111331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12600377189401 + 710767024900 = 3549701^2 + 843070^2 .
It is a cyclic number.
It is not a de Polignac number, because 13311144214301 - 210 = 13311144213277 is a prime.
It is a super-2 number, since 2×133111442143012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13311144214201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6655572107150 + 6655572107151.
It is an arithmetic number, because the mean of its divisors is an integer number (6655572107151).
Almost surely, 213311144214301 is an apocalyptic number.
It is an amenable number.
13311144214301 is a deficient number, since it is larger than the sum of its proper divisors (1).
13311144214301 is an equidigital number, since it uses as much as digits as its factorization.
13311144214301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3456, while the sum is 29.
Adding to 13311144214301 its reverse (10341244111331), we get a palindrome (23652388325632).
The spelling of 13311144214301 in words is "thirteen trillion, three hundred eleven billion, one hundred forty-four million, two hundred fourteen thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •