Base | Representation |
---|---|
bin | 111111010101001010… |
… | …1111011000100000001 |
3 | 111000001012111022112001 |
4 | 1332222111323010001 |
5 | 4212012434003331 |
6 | 142251155504001 |
7 | 12553152510001 |
oct | 1765225730401 |
9 | 430035438461 |
10 | 136001859841 |
11 | 52750560281 |
12 | 224368b8001 |
13 | ca95471ca3 |
14 | 6822640001 |
15 | 380ec17561 |
hex | 1faa57b101 |
136001859841 has 2 divisors, whose sum is σ = 136001859842. Its totient is φ = 136001859840.
The previous prime is 136001859823. The next prime is 136001859881. The reversal of 136001859841 is 148958100631.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 94451114241 + 41550745600 = 307329^2 + 203840^2 .
It is a cyclic number.
It is not a de Polignac number, because 136001859841 - 25 = 136001859809 is a prime.
It is a super-2 number, since 2×1360018598412 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 136001859791 and 136001859800.
It is not a weakly prime, because it can be changed into another prime (136001859811) 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, 68000929920 + 68000929921.
It is an arithmetic number, because the mean of its divisors is an integer number (68000929921).
Almost surely, 2136001859841 is an apocalyptic number.
It is an amenable number.
136001859841 is a deficient number, since it is larger than the sum of its proper divisors (1).
136001859841 is an equidigital number, since it uses as much as digits as its factorization.
136001859841 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 207360, while the sum is 46.
The spelling of 136001859841 in words is "one hundred thirty-six billion, one million, eight hundred fifty-nine thousand, eight hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •