Base | Representation |
---|---|
bin | 10000000100110001001… |
… | …100110011010100000001 |
3 | 10220121020201001111121100 |
4 | 100010301030303110001 |
5 | 121044241300101221 |
6 | 2203243322045013 |
7 | 142543545241326 |
oct | 20046114632401 |
9 | 3817221044540 |
10 | 1104632034561 |
11 | 396520a93130 |
12 | 15a103049769 |
13 | 80221630623 |
14 | 3b670742b4d |
15 | 1db02470926 |
hex | 10131333501 |
1104632034561 has 48 divisors (see below), whose sum is σ = 1789367606208. Its totient is φ = 650763849600.
The previous prime is 1104632034559. The next prime is 1104632034607. The reversal of 1104632034561 is 1654302364011.
1104632034561 is a `hidden beast` number, since 1 + 1 + 0 + 4 + 63 + 2 + 0 + 34 + 561 = 666.
It is not a de Polignac number, because 1104632034561 - 21 = 1104632034559 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1104632034521) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3744330 + ... + 4028556.
It is an arithmetic number, because the mean of its divisors is an integer number (37278491796).
Almost surely, 21104632034561 is an apocalyptic number.
1104632034561 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1104632034561 is a deficient number, since it is larger than the sum of its proper divisors (684735571647).
1104632034561 is a wasteful number, since it uses less digits than its factorization.
1104632034561 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 285342 (or 285339 counting only the distinct ones).
The product of its (nonzero) digits is 51840, while the sum is 36.
Adding to 1104632034561 its reverse (1654302364011), we get a palindrome (2758934398572).
The spelling of 1104632034561 in words is "one trillion, one hundred four billion, six hundred thirty-two million, thirty-four thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •