Base | Representation |
---|---|
bin | 1100010111000101110110… |
… | …1110110101101011101111 |
3 | 1210010021100122021220010012 |
4 | 3011301131232311223233 |
5 | 3240133024331143033 |
6 | 44523314435003435 |
7 | 2601622624062422 |
oct | 305613556655357 |
9 | 53107318256105 |
10 | 13590849084143 |
11 | 436a934aa4811 |
12 | 1635bb7a3957b |
13 | 7777c48058c6 |
14 | 34db2cc0b9b9 |
15 | 1887e0e67248 |
hex | c5c5dbb5aef |
13590849084143 has 4 divisors (see below), whose sum is σ = 13593535558680. Its totient is φ = 13588162609608.
The previous prime is 13590849084107. The next prime is 13590849084167. The reversal of 13590849084143 is 34148094809531.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 13590849084143 - 226 = 13590781975279 is a prime.
It is a super-3 number, since 3×135908490841433 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13590849084103) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1343229680 + ... + 1343239797.
It is an arithmetic number, because the mean of its divisors is an integer number (3398383889670).
Almost surely, 213590849084143 is an apocalyptic number.
13590849084143 is a deficient number, since it is larger than the sum of its proper divisors (2686474537).
13590849084143 is an equidigital number, since it uses as much as digits as its factorization.
13590849084143 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2686474536.
The product of its (nonzero) digits is 14929920, while the sum is 59.
The spelling of 13590849084143 in words is "thirteen trillion, five hundred ninety billion, eight hundred forty-nine million, eighty-four thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •