Base | Representation |
---|---|
bin | 10000000100011111111… |
… | …110110011101110001111 |
3 | 10220120111120110211100200 |
4 | 100010133332303232033 |
5 | 121043143321403201 |
6 | 2203154522224543 |
7 | 142533436631541 |
oct | 20043776635617 |
9 | 3816446424320 |
10 | 1104343153551 |
11 | 396392a135a0 |
12 | 15a042355153 |
13 | 801a6826811 |
14 | 3b644225691 |
15 | 1dad6e0b386 |
hex | 1011ffb3b8f |
1104343153551 has 24 divisors (see below), whose sum is σ = 1747843104384. Its totient is φ = 666350414160.
The previous prime is 1104343153523. The next prime is 1104343153559. The reversal of 1104343153551 is 1553513434011.
1104343153551 is a `hidden beast` number, since 1 + 1 + 0 + 43 + 4 + 31 + 535 + 51 = 666.
It is not a de Polignac number, because 1104343153551 - 25 = 1104343153519 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1104343153559) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 24547971 + ... + 24592916.
It is an arithmetic number, because the mean of its divisors is an integer number (72826796016).
Almost surely, 21104343153551 is an apocalyptic number.
1104343153551 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1104343153551 is a deficient number, since it is larger than the sum of its proper divisors (643499950833).
1104343153551 is a wasteful number, since it uses less digits than its factorization.
1104343153551 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 49141131 (or 49141128 counting only the distinct ones).
The product of its (nonzero) digits is 54000, while the sum is 36.
Adding to 1104343153551 its reverse (1553513434011), we get a palindrome (2657856587562).
The spelling of 1104343153551 in words is "one trillion, one hundred four billion, three hundred forty-three million, one hundred fifty-three thousand, five hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •