Base | Representation |
---|---|
bin | 1100000110101111101110… |
… | …1100000010110110100001 |
3 | 1202010102111222002220201112 |
4 | 3001223323230002312201 |
5 | 3221032421003411431 |
6 | 44150313255313105 |
7 | 2542421661302351 |
oct | 301537354026641 |
9 | 52112458086645 |
10 | 13310031310241 |
11 | 4271830756936 |
12 | 15ab6a667b795 |
13 | 757190b17953 |
14 | 3402cd51ab61 |
15 | 18135783ac2b |
hex | c1afbb02da1 |
13310031310241 has 2 divisors, whose sum is σ = 13310031310242. Its totient is φ = 13310031310240.
The previous prime is 13310031310229. The next prime is 13310031310259. The reversal of 13310031310241 is 14201313001331.
13310031310241 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10105945630225 + 3204085680016 = 3178985^2 + 1789996^2 .
It is a cyclic number.
It is not a de Polignac number, because 13310031310241 - 234 = 13292851441057 is a prime.
It is not a weakly prime, because it can be changed into another prime (13310031310271) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6655015655120 + 6655015655121.
It is an arithmetic number, because the mean of its divisors is an integer number (6655015655121).
Almost surely, 213310031310241 is an apocalyptic number.
It is an amenable number.
13310031310241 is a deficient number, since it is larger than the sum of its proper divisors (1).
13310031310241 is an equidigital number, since it uses as much as digits as its factorization.
13310031310241 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 23.
Adding to 13310031310241 its reverse (14201313001331), we get a palindrome (27511344311572).
The spelling of 13310031310241 in words is "thirteen trillion, three hundred ten billion, thirty-one million, three hundred ten thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •