Base | Representation |
---|---|
bin | 1100001110010110000000… |
… | …0100011101100011100000 |
3 | 1202120220110001020112201211 |
4 | 3003211200010131203200 |
5 | 3230202233444422202 |
6 | 44330302101435504 |
7 | 2555022500554510 |
oct | 303454004354340 |
9 | 52526401215654 |
10 | 13440564451552 |
11 | 4312125268a17 |
12 | 1610a55a0bb94 |
13 | 7665942a92c4 |
14 | 346753727840 |
15 | 1849473b21d7 |
hex | c396011d8e0 |
13440564451552 has 48 divisors (see below), whose sum is σ = 30884701317120. Its totient is φ = 5637683564928.
The previous prime is 13440564451547. The next prime is 13440564451553. The reversal of 13440564451552 is 25515446504431.
It is a junction number, because it is equal to n+sod(n) for n = 13440564451496 and 13440564451505.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13440564451553) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 638314152 + ... + 638335207.
It is an arithmetic number, because the mean of its divisors is an integer number (643431277440).
Almost surely, 213440564451552 is an apocalyptic number.
It is an amenable number.
13440564451552 is an abundant number, since it is smaller than the sum of its proper divisors (17444136865568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13440564451552 is a wasteful number, since it uses less digits than its factorization.
13440564451552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1276649423 (or 1276649415 counting only the distinct ones).
The product of its (nonzero) digits is 5760000, while the sum is 49.
The spelling of 13440564451552 in words is "thirteen trillion, four hundred forty billion, five hundred sixty-four million, four hundred fifty-one thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •