Base | Representation |
---|---|
bin | 1010000010110100110110… |
… | …1000010100010010111101 |
3 | 1110002202121212220210022220 |
4 | 2200231031220110102331 |
5 | 2421414410303120131 |
6 | 35253220000155553 |
7 | 2216610162323040 |
oct | 240551550242275 |
9 | 43082555823286 |
10 | 11043663332541 |
11 | 3578656052a04 |
12 | 12a4404608bb9 |
13 | 62154a42c4b8 |
14 | 2a273249ac57 |
15 | 14240eab2e96 |
hex | a0b4da144bd |
11043663332541 has 8 divisors (see below), whose sum is σ = 16828439363904. Its totient is φ = 6310664761440.
The previous prime is 11043663332497. The next prime is 11043663332551. The reversal of 11043663332541 is 14523336634011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11043663332541 - 217 = 11043663201469 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11043663332493 and 11043663332502.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11043663332551) 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, 262944365040 + ... + 262944365081.
It is an arithmetic number, because the mean of its divisors is an integer number (2103554920488).
Almost surely, 211043663332541 is an apocalyptic number.
It is an amenable number.
11043663332541 is a deficient number, since it is larger than the sum of its proper divisors (5784776031363).
11043663332541 is an equidigital number, since it uses as much as digits as its factorization.
11043663332541 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 525888730131.
The product of its (nonzero) digits is 466560, while the sum is 42.
Adding to 11043663332541 its reverse (14523336634011), we get a palindrome (25566999966552).
The spelling of 11043663332541 in words is "eleven trillion, forty-three billion, six hundred sixty-three million, three hundred thirty-two thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •