Base | Representation |
---|---|
bin | 1100000110110000000110… |
… | …1000110111011001000001 |
3 | 1202010102202220221210121222 |
4 | 3001230001220313121001 |
5 | 3221033122032441121 |
6 | 44150331223124425 |
7 | 2542424312655602 |
oct | 301540150673101 |
9 | 52112686853558 |
10 | 13310131140161 |
11 | 42718820415a9 |
12 | 15ab713ba3715 |
13 | 7571a86cbbcb |
14 | 3402dc8a5da9 |
15 | 1813614aa0ab |
hex | c1b01a37641 |
13310131140161 has 2 divisors, whose sum is σ = 13310131140162. Its totient is φ = 13310131140160.
The previous prime is 13310131140133. The next prime is 13310131140283. The reversal of 13310131140161 is 16104113101331.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13309801027600 + 330112561 = 3648260^2 + 18169^2 .
It is a cyclic number.
It is not a de Polignac number, because 13310131140161 - 218 = 13310130878017 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 13310131140161.
It is not a weakly prime, because it can be changed into another prime (13310131145161) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6655065570080 + 6655065570081.
It is an arithmetic number, because the mean of its divisors is an integer number (6655065570081).
Almost surely, 213310131140161 is an apocalyptic number.
It is an amenable number.
13310131140161 is a deficient number, since it is larger than the sum of its proper divisors (1).
13310131140161 is an equidigital number, since it uses as much as digits as its factorization.
13310131140161 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 26.
Adding to 13310131140161 its reverse (16104113101331), we get a palindrome (29414244241492).
The spelling of 13310131140161 in words is "thirteen trillion, three hundred ten billion, one hundred thirty-one million, one hundred forty thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •