Base | Representation |
---|---|
bin | 1100001001001101001100… |
… | …0111100010100111010011 |
3 | 1202021110121202201100202221 |
4 | 3002103103013202213103 |
5 | 3222231002340402311 |
6 | 44221543451121511 |
7 | 2545446310064452 |
oct | 302232307424723 |
9 | 52243552640687 |
10 | 13352300325331 |
11 | 4288751492560 |
12 | 15b7922443297 |
13 | 75b168cb3c96 |
14 | 34237d1acb99 |
15 | 1824cd623671 |
hex | c24d31e29d3 |
13352300325331 has 32 divisors (see below), whose sum is σ = 15105777603840. Its totient is φ = 11696774544000.
The previous prime is 13352300325277. The next prime is 13352300325337.
13352300325331 is nontrivially palindromic in base 10.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13352300325331 is a prime.
It is a super-2 number, since 2×133523003253312 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (13352300325337) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 27594781 + ... + 28074481.
It is an arithmetic number, because the mean of its divisors is an integer number (472055550120).
Almost surely, 213352300325331 is an apocalyptic number.
13352300325331 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13352300325331 is a deficient number, since it is larger than the sum of its proper divisors (1753477278509).
13352300325331 is a wasteful number, since it uses less digits than its factorization.
13352300325331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 480547.
The product of its (nonzero) digits is 72900, while the sum is 34.
It can be divided in two parts, 13352300 and 325331, that added together give a palindrome (13677631).
The spelling of 13352300325331 in words is "thirteen trillion, three hundred fifty-two billion, three hundred million, three hundred twenty-five thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •