Base | Representation |
---|---|
bin | 1100000110110011001111… |
… | …1110111101100001011001 |
3 | 1202010111221210022121211101 |
4 | 3001230303332331201121 |
5 | 3221041334300340431 |
6 | 44150551115031401 |
7 | 2542454250260200 |
oct | 301546376754131 |
9 | 52114853277741 |
10 | 13310975793241 |
11 | 42721759009a5 |
12 | 15ab90aa3b561 |
13 | 7572b16b7529 |
14 | 34037cb36237 |
15 | 1813b0702961 |
hex | c1b33fbd859 |
13310975793241 has 243 divisors, whose sum is σ = 18190231446303. Its totient is φ = 9708886091520.
The previous prime is 13310975793233. The next prime is 13310975793293. The reversal of 13310975793241 is 14239757901331.
The square root of 13310975793241 is 3648421.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 10363216448025 + 2947759345216 = 3219195^2 + 1716904^2 .
It is not a de Polignac number, because 13310975793241 - 23 = 13310975793233 is a prime.
It is not an unprimeable number, because it can be changed into a prime (13310975793211) by changing a digit.
It is a polite number, since it can be written in 242 ways as a sum of consecutive naturals, for example, 309557576566 + ... + 309557576608.
Almost surely, 213310975793241 is an apocalyptic number.
13310975793241 is the 3648421-st square number.
13310975793241 is the 1824211-st centered octagonal number.
It is an amenable number.
13310975793241 is a deficient number, since it is larger than the sum of its proper divisors (4879255653062).
13310975793241 is an equidigital number, since it uses as much as digits as its factorization.
13310975793241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 242 (or 121 counting only the distinct ones).
The product of its (nonzero) digits is 4286520, while the sum is 55.
The spelling of 13310975793241 in words is "thirteen trillion, three hundred ten billion, nine hundred seventy-five million, seven hundred ninety-three thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •