Base | Representation |
---|---|
bin | 11111000000111110010111… |
… | …101000100101100110000111 |
3 | 122212222022210021022212212111 |
4 | 133000332113220211212013 |
5 | 120334340312022244111 |
6 | 1202040123445201451 |
7 | 40506016003213600 |
oct | 3700762750454607 |
9 | 585868707285774 |
10 | 136406410353031 |
11 | 3a5106a759a0a5 |
12 | 13370586a00287 |
13 | 5b160b9346b00 |
14 | 259816965ada7 |
15 | 10b839cabda21 |
hex | 7c0f97a25987 |
136406410353031 has 18 divisors (see below), whose sum is σ = 171821672078112. Its totient is φ = 107925951042000.
The previous prime is 136406410353023. The next prime is 136406410353043. The reversal of 136406410353031 is 130353014604631.
It is not a de Polignac number, because 136406410353031 - 23 = 136406410353023 is a prime.
It is a super-2 number, since 2×1364064103530312 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136406410353091) by changing a digit.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 8236099095 + ... + 8236115656.
It is an arithmetic number, because the mean of its divisors is an integer number (9545648448784).
Almost surely, 2136406410353031 is an apocalyptic number.
136406410353031 is a deficient number, since it is larger than the sum of its proper divisors (35415261725081).
136406410353031 is a wasteful number, since it uses less digits than its factorization.
136406410353031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16472214791 (or 16472214771 counting only the distinct ones).
The product of its (nonzero) digits is 233280, while the sum is 40.
Adding to 136406410353031 its reverse (130353014604631), we get a palindrome (266759424957662).
The spelling of 136406410353031 in words is "one hundred thirty-six trillion, four hundred six billion, four hundred ten million, three hundred fifty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •