Base | Representation |
---|---|
bin | 1100000111111011000000… |
… | …1111100111101000010101 |
3 | 1202012100200101002020200011 |
4 | 3001332300033213220111 |
5 | 3221400313020411424 |
6 | 44203454454320221 |
7 | 2544035532620125 |
oct | 301766017475025 |
9 | 52170611066604 |
10 | 13330240403989 |
11 | 427a36120a103 |
12 | 15b35a6659071 |
13 | 759061911aa2 |
14 | 3412894b0c85 |
15 | 181b3bb0a694 |
hex | c1fb03e7a15 |
13330240403989 has 2 divisors, whose sum is σ = 13330240403990. Its totient is φ = 13330240403988.
The previous prime is 13330240403929. The next prime is 13330240404073. The reversal of 13330240403989 is 98930404203331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 12970190002225 + 360050401764 = 3601415^2 + 600042^2 .
It is a cyclic number.
It is not a de Polignac number, because 13330240403989 - 217 = 13330240272917 is a prime.
It is a super-2 number, since 2×133302404039892 (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 (13330240403929) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6665120201994 + 6665120201995.
It is an arithmetic number, because the mean of its divisors is an integer number (6665120201995).
Almost surely, 213330240403989 is an apocalyptic number.
It is an amenable number.
13330240403989 is a deficient number, since it is larger than the sum of its proper divisors (1).
13330240403989 is an equidigital number, since it uses as much as digits as its factorization.
13330240403989 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1679616, while the sum is 49.
The spelling of 13330240403989 in words is "thirteen trillion, three hundred thirty billion, two hundred forty million, four hundred three thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •