Base | Representation |
---|---|
bin | 10000000100011111011… |
… | …010011111010011101001 |
3 | 10220120110220120010021020 |
4 | 100010133122133103221 |
5 | 121043133402221440 |
6 | 2203153542203053 |
7 | 142533262666230 |
oct | 20043732372351 |
9 | 3816426503236 |
10 | 1104333632745 |
11 | 396388600462 |
12 | 15a03b123489 |
13 | 801a48720c5 |
14 | 3b642c67b17 |
15 | 1dad617a3d0 |
hex | 1011f69f4e9 |
1104333632745 has 64 divisors (see below), whose sum is σ = 2052819611136. Its totient is φ = 496474490880.
The previous prime is 1104333632729. The next prime is 1104333632777. The reversal of 1104333632745 is 5472363334011.
It is not a de Polignac number, because 1104333632745 - 24 = 1104333632729 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1104333632697 and 1104333632706.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 48134917 + ... + 48157853.
It is an arithmetic number, because the mean of its divisors is an integer number (32075306424).
Almost surely, 21104333632745 is an apocalyptic number.
1104333632745 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1104333632745 is a deficient number, since it is larger than the sum of its proper divisors (948485978391).
1104333632745 is a wasteful number, since it uses less digits than its factorization.
1104333632745 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30530.
The product of its (nonzero) digits is 544320, while the sum is 42.
Adding to 1104333632745 its reverse (5472363334011), we get a palindrome (6576696966756).
The spelling of 1104333632745 in words is "one trillion, one hundred four billion, three hundred thirty-three million, six hundred thirty-two thousand, seven hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •