Base | Representation |
---|---|
bin | 1100000110101101110010… |
… | …1111001100111101110001 |
3 | 1202010101011210000110220101 |
4 | 3001223130233030331301 |
5 | 3221030340040410101 |
6 | 44150145545512401 |
7 | 2542403054514646 |
oct | 301533457147561 |
9 | 52111153013811 |
10 | 13309512044401 |
11 | 4271594630811 |
12 | 15ab5807a2701 |
13 | 75710a378661 |
14 | 34028058bdcd |
15 | 181326e69401 |
hex | c1adcbccf71 |
13309512044401 has 8 divisors (see below), whose sum is σ = 13318101665064. Its totient is φ = 13300925024640.
The previous prime is 13309512044341. The next prime is 13309512044497. The reversal of 13309512044401 is 10444021590331.
It can be written as a sum of positive squares in 4 ways, for example, as 84652484401 + 13224859560000 = 290951^2 + 3636600^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13309512044401 - 211 = 13309512042353 is a prime.
It is a super-2 number, since 2×133095120444012 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13309512014401) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9640071 + ... + 10933891.
It is an arithmetic number, because the mean of its divisors is an integer number (1664762708133).
Almost surely, 213309512044401 is an apocalyptic number.
It is an amenable number.
13309512044401 is a deficient number, since it is larger than the sum of its proper divisors (8589620663).
13309512044401 is a wasteful number, since it uses less digits than its factorization.
13309512044401 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1300451.
The product of its (nonzero) digits is 51840, while the sum is 37.
The spelling of 13309512044401 in words is "thirteen trillion, three hundred nine billion, five hundred twelve million, forty-four thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •