Base | Representation |
---|---|
bin | 1100001000000010110001… |
… | …0100010100100010100101 |
3 | 1202012120001102222212002021 |
4 | 3002000230110110202211 |
5 | 3221414043413330201 |
6 | 44204441214343141 |
7 | 2544141240161116 |
oct | 302005424244245 |
9 | 52176042885067 |
10 | 13332322011301 |
11 | 428022a225527 |
12 | 15b3a877baab1 |
13 | 759303c5cca7 |
14 | 341405b3020d |
15 | 181c0e73cea1 |
hex | c202c5148a5 |
13332322011301 has 16 divisors (see below), whose sum is σ = 13802195635200. Its totient is φ = 12863127691008.
The previous prime is 13332322011287. The next prime is 13332322011311. The reversal of 13332322011301 is 10311022323331.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13332322011301 is a prime.
It is a super-4 number, since 4×133323220113014 (a number of 54 digits) contains 4444 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13332322011311) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 242735920 + ... + 242790838.
It is an arithmetic number, because the mean of its divisors is an integer number (862637227200).
Almost surely, 213332322011301 is an apocalyptic number.
It is an amenable number.
13332322011301 is a deficient number, since it is larger than the sum of its proper divisors (469873623899).
13332322011301 is a wasteful number, since it uses less digits than its factorization.
13332322011301 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 60948.
The product of its (nonzero) digits is 1944, while the sum is 25.
Adding to 13332322011301 its reverse (10311022323331), we get a palindrome (23643344334632).
The spelling of 13332322011301 in words is "thirteen trillion, three hundred thirty-two billion, three hundred twenty-two million, eleven thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •