Base | Representation |
---|---|
bin | 10000000100001100111… |
… | …110111001101111111110 |
3 | 10220112200100201000221222 |
4 | 100010030332321233332 |
5 | 121042020222124014 |
6 | 2203103134353342 |
7 | 142522516441421 |
oct | 20041476715776 |
9 | 3815610630858 |
10 | 1104024411134 |
11 | 396239aa8707 |
12 | 159b7365b852 |
13 | 80155795b38 |
14 | 3b613b739b8 |
15 | 1dab8e4908e |
hex | 1010cfb9bfe |
1104024411134 has 8 divisors (see below), whose sum is σ = 1676999105760. Its totient is φ = 545024709216.
The previous prime is 1104024411131. The next prime is 1104024411137. The reversal of 1104024411134 is 4311144204011.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (1104024411131) and next prime (1104024411137).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1104024411131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3493747979 + ... + 3493748294.
It is an arithmetic number, because the mean of its divisors is an integer number (209624888220).
Almost surely, 21104024411134 is an apocalyptic number.
1104024411134 is a deficient number, since it is larger than the sum of its proper divisors (572974694626).
1104024411134 is an equidigital number, since it uses as much as digits as its factorization.
1104024411134 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6987496354.
The product of its (nonzero) digits is 1536, while the sum is 26.
Adding to 1104024411134 its reverse (4311144204011), we get a palindrome (5415168615145).
The spelling of 1104024411134 in words is "one trillion, one hundred four billion, twenty-four million, four hundred eleven thousand, one hundred thirty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •