Base | Representation |
---|---|
bin | 11111000001010001000100… |
… | …001001111000010111100011 |
3 | 122220001020121021121212100112 |
4 | 133001101010021320113203 |
5 | 120340202420031143021 |
6 | 1202053243430441535 |
7 | 40510326316602431 |
oct | 3701210411702743 |
9 | 586036537555315 |
10 | 136426484631011 |
11 | 3a519168a41283 |
12 | 133744498032ab |
13 | 5b17c6822a4c3 |
14 | 2599111759d51 |
15 | 10b8b7510cd5b |
hex | 7c14442785e3 |
136426484631011 has 8 divisors (see below), whose sum is σ = 143608732262400. Its totient is φ = 129244427633160.
The previous prime is 136426484630993. The next prime is 136426484631091. The reversal of 136426484631011 is 110136484624631.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 136426484631011 - 226 = 136426417522147 is a prime.
It is a super-2 number, since 2×1364264846310112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (136426484631091) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 46188251 + ... + 49053108.
It is an arithmetic number, because the mean of its divisors is an integer number (17951091532800).
Almost surely, 2136426484631011 is an apocalyptic number.
136426484631011 is a deficient number, since it is larger than the sum of its proper divisors (7182247631389).
136426484631011 is an equidigital number, since it uses as much as digits as its factorization.
136426484631011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95316769.
The product of its (nonzero) digits is 1990656, while the sum is 50.
The spelling of 136426484631011 in words is "one hundred thirty-six trillion, four hundred twenty-six billion, four hundred eighty-four million, six hundred thirty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •