Base | Representation |
---|---|
bin | 10000001111000010010… |
… | …000001101101101101001 |
3 | 10221122200221202121201211 |
4 | 100033002100031231221 |
5 | 121234330310410131 |
6 | 2212305230313121 |
7 | 143413661535511 |
oct | 20170220155551 |
9 | 3848627677654 |
10 | 1115655560041 |
11 | 3a0168529a70 |
12 | 16027a9587a1 |
13 | 8128a3a3c79 |
14 | 3bdd87b8841 |
15 | 1e04a10a5b1 |
hex | 103c240db69 |
1115655560041 has 32 divisors (see below), whose sum is σ = 1252960819200. Its totient is φ = 984807046080.
The previous prime is 1115655559981. The next prime is 1115655560057. The reversal of 1115655560041 is 1400655565111.
It is a happy number.
It is not a de Polignac number, because 1115655560041 - 223 = 1115647171433 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1115655559976 and 1115655560003.
It is not an unprimeable number, because it can be changed into a prime (1115655560641) 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, 35675070 + ... + 35706328.
It is an arithmetic number, because the mean of its divisors is an integer number (39155025600).
Almost surely, 21115655560041 is an apocalyptic number.
1115655560041 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1115655560041 is a deficient number, since it is larger than the sum of its proper divisors (137305259159).
1115655560041 is a wasteful number, since it uses less digits than its factorization.
1115655560041 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32029.
The product of its (nonzero) digits is 90000, while the sum is 40.
The spelling of 1115655560041 in words is "one trillion, one hundred fifteen billion, six hundred fifty-five million, five hundred sixty thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •