Base | Representation |
---|---|
bin | 1100101010111011011001… |
… | …1000110100101111111011 |
3 | 1211022211222212110100102221 |
4 | 3022232312120310233323 |
5 | 3311223444024324010 |
6 | 45344035003304511 |
7 | 2635345666533121 |
oct | 312566630645773 |
9 | 54284885410387 |
10 | 13931638901755 |
11 | 4491413a65783 |
12 | 169006581b137 |
13 | 7a0995213063 |
14 | 36241b395911 |
15 | 1925d9622dda |
hex | cabb6634bfb |
13931638901755 has 8 divisors (see below), whose sum is σ = 16718023868112. Its totient is φ = 11145272997408.
The previous prime is 13931638901743. The next prime is 13931638901767. The reversal of 13931638901755 is 55710983613931.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (13931638901743) and next prime (13931638901767).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13931638901755 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13931638901693 and 13931638901702.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3105012 + ... + 6124081.
It is an arithmetic number, because the mean of its divisors is an integer number (2089752983514).
Almost surely, 213931638901755 is an apocalyptic number.
13931638901755 is a deficient number, since it is larger than the sum of its proper divisors (2786384966357).
13931638901755 is an equidigital number, since it uses as much as digits as its factorization.
13931638901755 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9531005.
The product of its (nonzero) digits is 18370800, while the sum is 61.
The spelling of 13931638901755 in words is "thirteen trillion, nine hundred thirty-one billion, six hundred thirty-eight million, nine hundred one thousand, seven hundred fifty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •