Base | Representation |
---|---|
bin | 1100000111101011110101… |
… | …0110000101001101111000 |
3 | 1202011222011100221012010210 |
4 | 3001322331112011031320 |
5 | 3221313441300001202 |
6 | 44201542241311120 |
7 | 2543532540346512 |
oct | 301727526051570 |
9 | 52158140835123 |
10 | 13326165234552 |
11 | 427865a953a85 |
12 | 15b28499354a0 |
13 | 758862561921 |
14 | 340dc0190bb2 |
15 | 18199de87c6c |
hex | c1ebd585378 |
13326165234552 has 64 divisors (see below), whose sum is σ = 35090653248000. Its totient is φ = 4205647021824.
The previous prime is 13326165234517. The next prime is 13326165234661. The reversal of 13326165234552 is 25543256162331.
It is a super-2 number, since 2×133261652345522 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 in 15 ways as a sum of consecutive naturals, for example, 8347728 + ... + 9815135.
It is an arithmetic number, because the mean of its divisors is an integer number (548291457000).
Almost surely, 213326165234552 is an apocalyptic number.
13326165234552 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
13326165234552 is an abundant number, since it is smaller than the sum of its proper divisors (21764488013448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13326165234552 is a wasteful number, since it uses less digits than its factorization.
13326165234552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18164500 (or 18164496 counting only the distinct ones).
The product of its digits is 3888000, while the sum is 48.
The spelling of 13326165234552 in words is "thirteen trillion, three hundred twenty-six billion, one hundred sixty-five million, two hundred thirty-four thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •