Base | Representation |
---|---|
bin | 1100011011011100000111… |
… | …0110010100100000100011 |
3 | 1210101102011012110200112122 |
4 | 3012313001312110200203 |
5 | 3242344013030223133 |
6 | 45021510333214455 |
7 | 2610205620506303 |
oct | 306670166244043 |
9 | 53342135420478 |
10 | 13665543211043 |
11 | 43995849788a9 |
12 | 164858293142b |
13 | 781869605a29 |
14 | 3535b7023603 |
15 | 18a713710498 |
hex | c6dc1d94823 |
13665543211043 has 8 divisors (see below), whose sum is σ = 14140619880480. Its totient is φ = 13190723277760.
The previous prime is 13665543211031. The next prime is 13665543211063. The reversal of 13665543211043 is 34011234556631.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13665543211043 - 224 = 13665526433827 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13665543210985 and 13665543211003.
It is not an unprimeable number, because it can be changed into a prime (13665543211063) 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, 64075730 + ... + 64288647.
It is an arithmetic number, because the mean of its divisors is an integer number (1767577485060).
Almost surely, 213665543211043 is an apocalyptic number.
13665543211043 is a deficient number, since it is larger than the sum of its proper divisors (475076669437).
13665543211043 is a wasteful number, since it uses less digits than its factorization.
13665543211043 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 128368077.
The product of its (nonzero) digits is 777600, while the sum is 44.
Adding to 13665543211043 its reverse (34011234556631), we get a palindrome (47676777767674).
The spelling of 13665543211043 in words is "thirteen trillion, six hundred sixty-five billion, five hundred forty-three million, two hundred eleven thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •