Base | Representation |
---|---|
bin | 10000100010101110111… |
… | …000100000001101101111 |
3 | 11000200021220221111201201 |
4 | 100202232320200031233 |
5 | 122111134141214433 |
6 | 2230124033150331 |
7 | 145063045403536 |
oct | 20425670401557 |
9 | 4020256844651 |
10 | 1136805413743 |
11 | 3a91310240aa |
12 | 1643a19bb3a7 |
13 | 8327b0661bc |
14 | 3d04369931d |
15 | 1e886ca8a7d |
hex | 108aee2036f |
1136805413743 has 4 divisors (see below), whose sum is σ = 1136864094840. Its totient is φ = 1136746732648.
The previous prime is 1136805413699. The next prime is 1136805413753. The reversal of 1136805413743 is 3473145086311.
It is a happy number.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1136805413743 - 29 = 1136805413231 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1136805413693 and 1136805413702.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1136805413753) 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 3 ways as a sum of consecutive naturals, for example, 29311480 + ... + 29350237.
It is an arithmetic number, because the mean of its divisors is an integer number (284216023710).
Almost surely, 21136805413743 is an apocalyptic number.
1136805413743 is a deficient number, since it is larger than the sum of its proper divisors (58681097).
1136805413743 is an equidigital number, since it uses as much as digits as its factorization.
1136805413743 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58681096.
The product of its (nonzero) digits is 725760, while the sum is 46.
The spelling of 1136805413743 in words is "one trillion, one hundred thirty-six billion, eight hundred five million, four hundred thirteen thousand, seven hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •