Base | Representation |
---|---|
bin | 1100011011001001011101… |
… | …0111000100110111011111 |
3 | 1210100221020012102001011020 |
4 | 3012302113113010313133 |
5 | 3242303234031111033 |
6 | 45015321402455223 |
7 | 2606640542061546 |
oct | 306622727046737 |
9 | 53327205361136 |
10 | 13660535410143 |
11 | 4397445122976 |
12 | 1647605804513 |
13 | 78124bc7552b |
14 | 35325dcd115d |
15 | 18a51dc676b3 |
hex | c6c975c4ddf |
13660535410143 has 32 divisors (see below), whose sum is σ = 19806515953920. Its totient is φ = 8342613465600.
The previous prime is 13660535410069. The next prime is 13660535410183. The reversal of 13660535410143 is 34101453506631.
It is not a de Polignac number, because 13660535410143 - 220 = 13660534361567 is a prime.
It is a super-2 number, since 2×136605354101432 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 13660535410095 and 13660535410104.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13660535410183) 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, 22170805 + ... + 22778622.
It is an arithmetic number, because the mean of its divisors is an integer number (618953623560).
Almost surely, 213660535410143 is an apocalyptic number.
13660535410143 is a deficient number, since it is larger than the sum of its proper divisors (6145980543777).
13660535410143 is a wasteful number, since it uses less digits than its factorization.
13660535410143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 44949607.
The product of its (nonzero) digits is 388800, while the sum is 42.
Adding to 13660535410143 its reverse (34101453506631), we get a palindrome (47761988916774).
The spelling of 13660535410143 in words is "thirteen trillion, six hundred sixty billion, five hundred thirty-five million, four hundred ten thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •