Base | Representation |
---|---|
bin | 1100010100101110011111… |
… | …0001011101000011011111 |
3 | 1202222101110210202110021222 |
4 | 3011023213301131003133 |
5 | 3234001320112240133 |
6 | 44452514421043555 |
7 | 2565653653052552 |
oct | 305134761350337 |
9 | 52871423673258 |
10 | 13550215352543 |
11 | 4354683349851 |
12 | 162a1578565bb |
13 | 773a1a37713c |
14 | 34bb963d6699 |
15 | 1877139ece98 |
hex | c52e7c5d0df |
13550215352543 has 8 divisors (see below), whose sum is σ = 13736719736016. Its totient is φ = 13363734888000.
The previous prime is 13550215352521. The next prime is 13550215352573. The reversal of 13550215352543 is 34525351205531.
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-13550215352543 is a prime.
It is a super-2 number, since 2×135502153525432 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13550215352494 and 13550215352503.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13550215352503) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4837433 + ... + 7106418.
It is an arithmetic number, because the mean of its divisors is an integer number (1717089967002).
Almost surely, 213550215352543 is an apocalyptic number.
13550215352543 is a deficient number, since it is larger than the sum of its proper divisors (186504383473).
13550215352543 is a wasteful number, since it uses less digits than its factorization.
13550215352543 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11959465.
The product of its (nonzero) digits is 1350000, while the sum is 44.
The spelling of 13550215352543 in words is "thirteen trillion, five hundred fifty billion, two hundred fifteen million, three hundred fifty-two thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •