Base | Representation |
---|---|
bin | 1100100100011101111100… |
… | …1001111101011001100000 |
3 | 1210221020112010021000101120 |
4 | 3021013133021331121200 |
5 | 3302414144323034214 |
6 | 45221042021532240 |
7 | 2624336453213112 |
oct | 311073711753140 |
9 | 53836463230346 |
10 | 13820653721184 |
11 | 44493407a3952 |
12 | 1672650b74080 |
13 | 79338889738b |
14 | 35accd4013b2 |
15 | 18e790cc4ea9 |
hex | c91df27d660 |
13820653721184 has 48 divisors (see below), whose sum is σ = 36279413533440. Its totient is φ = 4606859492480.
The previous prime is 13820653721159. The next prime is 13820653721209. The reversal of 13820653721184 is 48112735602831.
It is an interprime number because it is at equal distance from previous prime (13820653721159) and next prime (13820653721209).
It is a tau number, because it is divible by the number of its divisors (48).
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 7 ways as a sum of consecutive naturals, for example, 27962797 + ... + 28452755.
It is an arithmetic number, because the mean of its divisors is an integer number (755821115280).
Almost surely, 213820653721184 is an apocalyptic number.
It is an amenable number.
13820653721184 is an abundant number, since it is smaller than the sum of its proper divisors (22458759812256).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
13820653721184 is a wasteful number, since it uses less digits than its factorization.
13820653721184 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 783803 (or 783795 counting only the distinct ones).
The product of its (nonzero) digits is 1935360, while the sum is 51.
The spelling of 13820653721184 in words is "thirteen trillion, eight hundred twenty billion, six hundred fifty-three million, seven hundred twenty-one thousand, one hundred eighty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •