Base | Representation |
---|---|
bin | 10000001010110101101… |
… | …101101100001111001000 |
3 | 10221020001222011102202202 |
4 | 100022311231230033020 |
5 | 121201113423404021 |
6 | 2210242205215332 |
7 | 143164224000212 |
oct | 20126555541710 |
9 | 3836058142682 |
10 | 1111150216136 |
11 | 399266369454 |
12 | 15b421b61548 |
13 | 80a1cb78cbc |
14 | 3bacc2bb5b2 |
15 | 1dd84813a0b |
hex | 102b5b6c3c8 |
1111150216136 has 8 divisors (see below), whose sum is σ = 2083406655270. Its totient is φ = 555575108064.
The previous prime is 1111150216081. The next prime is 1111150216139. The reversal of 1111150216136 is 6316120511111.
It can be written as a sum of positive squares in only one way, i.e., 890935883236 + 220214332900 = 943894^2 + 469270^2 .
It is a tau number, because it is divible by the number of its divisors (8).
It is a junction number, because it is equal to n+sod(n) for n = 1111150216099 and 1111150216108.
It is not an unprimeable number, because it can be changed into a prime (1111150216139) 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 as a sum of consecutive naturals, namely, 69446888501 + ... + 69446888516.
Almost surely, 21111150216136 is an apocalyptic number.
It is an amenable number.
1111150216136 is a deficient number, since it is larger than the sum of its proper divisors (972256439134).
1111150216136 is a wasteful number, since it uses less digits than its factorization.
1111150216136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138893777023 (or 138893777019 counting only the distinct ones).
The product of its (nonzero) digits is 1080, while the sum is 29.
Adding to 1111150216136 its reverse (6316120511111), we get a palindrome (7427270727247).
The spelling of 1111150216136 in words is "one trillion, one hundred eleven billion, one hundred fifty million, two hundred sixteen thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •