Base | Representation |
---|---|
bin | 11111000100000110101110… |
… | …100100010011010110101111 |
3 | 122220201220002021020120220111 |
4 | 133010012232210103112233 |
5 | 120401401410112024021 |
6 | 1202323023130400451 |
7 | 40530403131433621 |
oct | 3704065644232657 |
9 | 586656067216814 |
10 | 136621543470511 |
11 | 3a593964633460 |
12 | 133a6206590127 |
13 | 5b3048294c768 |
14 | 25a47374d4c11 |
15 | 10bdc8e89e8e1 |
hex | 7c41ae9135af |
136621543470511 has 16 divisors (see below), whose sum is σ = 151376146122240. Its totient is φ = 122265348266880.
The previous prime is 136621543470497. The next prime is 136621543470541. The reversal of 136621543470511 is 115074345126631.
It is a cyclic number.
It is not a de Polignac number, because 136621543470511 - 27 = 136621543470383 is a prime.
It is a super-2 number, since 2×1366215434705112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136621543470541) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 232966741 + ... + 233552446.
It is an arithmetic number, because the mean of its divisors is an integer number (9461009132640).
Almost surely, 2136621543470511 is an apocalyptic number.
136621543470511 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
136621543470511 is a deficient number, since it is larger than the sum of its proper divisors (14754602651729).
136621543470511 is a wasteful number, since it uses less digits than its factorization.
136621543470511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 466519614.
The product of its (nonzero) digits is 1814400, while the sum is 49.
The spelling of 136621543470511 in words is "one hundred thirty-six trillion, six hundred twenty-one billion, five hundred forty-three million, four hundred seventy thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •