Base | Representation |
---|---|
bin | 10000000100001101111… |
… | …110100110111010100001 |
3 | 10220112201112010111010222 |
4 | 100010031332212322201 |
5 | 121042034011024301 |
6 | 2203104532332425 |
7 | 142523111414600 |
oct | 20041576467241 |
9 | 3815645114128 |
10 | 1104041111201 |
11 | 396248474716 |
12 | 159b79174115 |
13 | 80159092232 |
14 | 3b61607da37 |
15 | 1daba64731b |
hex | 1010dfa6ea1 |
1104041111201 has 12 divisors (see below), whose sum is σ = 1284309844848. Its totient is φ = 946308335112.
The previous prime is 1104041111177. The next prime is 1104041111249. The reversal of 1104041111201 is 1021111404011.
It is a de Polignac number, because none of the positive numbers 2k-1104041111201 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 1104041111201.
It is not an unprimeable number, because it can be changed into a prime (1104041111401) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7010810 + ... + 7166556.
It is an arithmetic number, because the mean of its divisors is an integer number (107025820404).
Almost surely, 21104041111201 is an apocalyptic number.
It is an amenable number.
1104041111201 is a deficient number, since it is larger than the sum of its proper divisors (180268733647).
1104041111201 is a wasteful number, since it uses less digits than its factorization.
1104041111201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 300428 (or 300421 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 1104041111201 its reverse (1021111404011), we get a palindrome (2125152515212).
The spelling of 1104041111201 in words is "one trillion, one hundred four billion, forty-one million, one hundred eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.001 sec. • engine limits •