Base | Representation |
---|---|
bin | 111111010110100111… |
… | …0000111101111011101 |
3 | 111000011120100112001021 |
4 | 1332231032013233131 |
5 | 4212112314140034 |
6 | 142300042444141 |
7 | 12554310106522 |
oct | 1765516075735 |
9 | 430146315037 |
10 | 136050146269 |
11 | 52775840614 |
12 | 2244ab03651 |
13 | caa247a43b |
14 | 6828c0d149 |
15 | 38140a46b4 |
hex | 1fad387bdd |
136050146269 has 2 divisors, whose sum is σ = 136050146270. Its totient is φ = 136050146268.
The previous prime is 136050146249. The next prime is 136050146299. The reversal of 136050146269 is 962641050631.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 110448546244 + 25601600025 = 332338^2 + 160005^2 .
It is a cyclic number.
It is not a de Polignac number, because 136050146269 - 217 = 136050015197 is a prime.
It is a super-2 number, since 2×1360501462692 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (136050146249) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68025073134 + 68025073135.
It is an arithmetic number, because the mean of its divisors is an integer number (68025073135).
Almost surely, 2136050146269 is an apocalyptic number.
It is an amenable number.
136050146269 is a deficient number, since it is larger than the sum of its proper divisors (1).
136050146269 is an equidigital number, since it uses as much as digits as its factorization.
136050146269 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 233280, while the sum is 43.
The spelling of 136050146269 in words is "one hundred thirty-six billion, fifty million, one hundred forty-six thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •