Base | Representation |
---|---|
bin | 11110111100100011010111… |
… | …110010100100011100101101 |
3 | 122211220021110022020110220201 |
4 | 132330203113302210130231 |
5 | 120314401002233033311 |
6 | 1201244351235313501 |
7 | 40445040630134656 |
oct | 3674432762443455 |
9 | 584807408213821 |
10 | 136102544033581 |
11 | 3a403845a14874 |
12 | 1332170274b891 |
13 | 5ac3551500618 |
14 | 2587580c4252d |
15 | 10b0515c939c1 |
hex | 7bc8d7ca472d |
136102544033581 has 2 divisors, whose sum is σ = 136102544033582. Its totient is φ = 136102544033580.
The previous prime is 136102544033537. The next prime is 136102544033647. The reversal of 136102544033581 is 185330445201631.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 135187012730025 + 915531303556 = 11626995^2 + 956834^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-136102544033581 is a prime.
It is a super-2 number, since 2×1361025440335812 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (136102544003581) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68051272016790 + 68051272016791.
It is an arithmetic number, because the mean of its divisors is an integer number (68051272016791).
Almost surely, 2136102544033581 is an apocalyptic number.
It is an amenable number.
136102544033581 is a deficient number, since it is larger than the sum of its proper divisors (1).
136102544033581 is an equidigital number, since it uses as much as digits as its factorization.
136102544033581 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1036800, while the sum is 46.
The spelling of 136102544033581 in words is "one hundred thirty-six trillion, one hundred two billion, five hundred forty-four million, thirty-three thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •