Base | Representation |
---|---|
bin | 1100001001101110001011… |
… | …0000110000011011010100 |
3 | 1202022022110201001201222002 |
4 | 3002123202300300123110 |
5 | 3222402120044111034 |
6 | 44230010120454432 |
7 | 2546211551162126 |
oct | 302334260603324 |
9 | 52268421051862 |
10 | 13361152722644 |
11 | 42914844296a1 |
12 | 15b959301a418 |
13 | 75bc49cc45bc |
14 | 34297cb61216 |
15 | 18284a895e7e |
hex | c26e2c306d4 |
13361152722644 has 6 divisors (see below), whose sum is σ = 23382017264634. Its totient is φ = 6680576361320.
The previous prime is 13361152722637. The next prime is 13361152722649. The reversal of 13361152722644 is 44622725116331.
It can be written as a sum of positive squares in only one way, i.e., 8636181032644 + 4724971690000 = 2938738^2 + 2173700^2 .
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13361152722649) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1670144090327 + ... + 1670144090334.
It is an arithmetic number, because the mean of its divisors is an integer number (3897002877439).
Almost surely, 213361152722644 is an apocalyptic number.
It is an amenable number.
13361152722644 is a deficient number, since it is larger than the sum of its proper divisors (10020864541990).
13361152722644 is a wasteful number, since it uses less digits than its factorization.
13361152722644 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3340288180665 (or 3340288180663 counting only the distinct ones).
The product of its digits is 1451520, while the sum is 47.
Adding to 13361152722644 its reverse (44622725116331), we get a palindrome (57983877838975).
The spelling of 13361152722644 in words is "thirteen trillion, three hundred sixty-one billion, one hundred fifty-two million, seven hundred twenty-two thousand, six hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •