Base | Representation |
---|---|
bin | 10000000100010010010… |
… | …100101100111111000101 |
3 | 10220112220121022020101022 |
4 | 100010102110230333011 |
5 | 121042211141341401 |
6 | 2203120055040525 |
7 | 142524655152632 |
oct | 20042224547705 |
9 | 3815817266338 |
10 | 1104114012101 |
11 | 3962856371a1 |
12 | 159b99670145 |
13 | 8016b208269 |
14 | 3b621a19189 |
15 | 1dac1c4771b |
hex | 1011252cfc5 |
1104114012101 has 32 divisors (see below), whose sum is σ = 1158070193280. Its totient is φ = 1051320211200.
The previous prime is 1104114012083. The next prime is 1104114012121. The reversal of 1104114012101 is 1012104114011.
It is a cyclic number.
It is not a de Polignac number, because 1104114012101 - 226 = 1104046903237 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1104114012101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1104114012121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 988463195 + ... + 988464311.
It is an arithmetic number, because the mean of its divisors is an integer number (36189693540).
Almost surely, 21104114012101 is an apocalyptic number.
It is an amenable number.
1104114012101 is a deficient number, since it is larger than the sum of its proper divisors (53956181179).
1104114012101 is a wasteful number, since it uses less digits than its factorization.
1104114012101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2405.
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 1104114012101 its reverse (1012104114011), we get a palindrome (2116218126112).
The spelling of 1104114012101 in words is "one trillion, one hundred four billion, one hundred fourteen million, twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •