Base | Representation |
---|---|
bin | 111111100001110110… |
… | …1101111100001110001 |
3 | 111001010212110211022021 |
4 | 1333003231233201301 |
5 | 4213400422100244 |
6 | 142401323311441 |
7 | 12566541623563 |
oct | 1770355574161 |
9 | 431125424267 |
10 | 136427534449 |
11 | 52949871978 |
12 | 2253537b581 |
13 | cb3270285b |
14 | 6862da9333 |
15 | 383729d284 |
hex | 1fc3b6f871 |
136427534449 has 2 divisors, whose sum is σ = 136427534450. Its totient is φ = 136427534448.
The previous prime is 136427534443. The next prime is 136427534461. The reversal of 136427534449 is 944435724631.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 92639879424 + 43787655025 = 304368^2 + 209255^2 .
It is a cyclic number.
It is not a de Polignac number, because 136427534449 - 217 = 136427403377 is a prime.
It is a super-2 number, since 2×1364275344492 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 136427534396 and 136427534405.
It is not a weakly prime, because it can be changed into another prime (136427534443) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 68213767224 + 68213767225.
It is an arithmetic number, because the mean of its divisors is an integer number (68213767225).
Almost surely, 2136427534449 is an apocalyptic number.
It is an amenable number.
136427534449 is a deficient number, since it is larger than the sum of its proper divisors (1).
136427534449 is an equidigital number, since it uses as much as digits as its factorization.
136427534449 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 8709120, while the sum is 52.
The spelling of 136427534449 in words is "one hundred thirty-six billion, four hundred twenty-seven million, five hundred thirty-four thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •