Base | Representation |
---|---|
bin | 10000000100011111011… |
… | …100000010111111000111 |
3 | 10220120110221022212022221 |
4 | 100010133130002333013 |
5 | 121043134003303111 |
6 | 2203153555033211 |
7 | 142533266316454 |
oct | 20043734027707 |
9 | 3816427285287 |
10 | 1104334041031 |
11 | 39638885a191 |
12 | 15a03b29b807 |
13 | 801a4985bb0 |
14 | 3b642d3282b |
15 | 1dad620b371 |
hex | 1011f702fc7 |
1104334041031 has 32 divisors (see below), whose sum is σ = 1266886692288. Its totient is φ = 953607997440.
The previous prime is 1104334041023. The next prime is 1104334041047. The reversal of 1104334041031 is 1301404334011.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 1104334041031 - 23 = 1104334041023 is a prime.
It is a super-2 number, since 2×11043340410312 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1104334040987 and 1104334041005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1104334041011) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 36030445 + ... + 36061081.
It is an arithmetic number, because the mean of its divisors is an integer number (39590209134).
Almost surely, 21104334041031 is an apocalyptic number.
1104334041031 is a deficient number, since it is larger than the sum of its proper divisors (162552651257).
1104334041031 is a wasteful number, since it uses less digits than its factorization.
1104334041031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31651.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 1104334041031 its reverse (1301404334011), we get a palindrome (2405738375042).
The spelling of 1104334041031 in words is "one trillion, one hundred four billion, three hundred thirty-four million, forty-one thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •