Base | Representation |
---|---|
bin | 1100010111000110110100… |
… | …1101000100111000100011 |
3 | 1210010022000201202011112210 |
4 | 3011301231031010320203 |
5 | 3240134042304401323 |
6 | 44523400310453203 |
7 | 2601632225364450 |
oct | 305615515047043 |
9 | 53108021664483 |
10 | 13591108668963 |
11 | 436aa58584721 |
12 | 163606a964203 |
13 | 777836522ba7 |
14 | 34db554a0827 |
15 | 188808b41293 |
hex | c5c6d344e23 |
13591108668963 has 32 divisors (see below), whose sum is σ = 20776980450816. Its totient is φ = 7741331232768.
The previous prime is 13591108668887. The next prime is 13591108668971. The reversal of 13591108668963 is 36986680119531.
It is not a de Polignac number, because 13591108668963 - 28 = 13591108668707 is a prime.
It is a super-2 number, since 2×135911086689632 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13591108668894 and 13591108668903.
It is not an unprimeable number, because it can be changed into a prime (13591108668563) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 113928195 + ... + 114047427.
It is an arithmetic number, because the mean of its divisors is an integer number (649280639088).
Almost surely, 213591108668963 is an apocalyptic number.
13591108668963 is a deficient number, since it is larger than the sum of its proper divisors (7185871781853).
13591108668963 is a wasteful number, since it uses less digits than its factorization.
13591108668963 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 136683.
The product of its (nonzero) digits is 50388480, while the sum is 66.
The spelling of 13591108668963 in words is "thirteen trillion, five hundred ninety-one billion, one hundred eight million, six hundred sixty-eight thousand, nine hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •