Base | Representation |
---|---|
bin | 11111000000101011000001… |
… | …101111110010011101011001 |
3 | 122212220100011220002122022201 |
4 | 133000223001233302131121 |
5 | 120334020243331003241 |
6 | 1202022410552250201 |
7 | 40504352231426422 |
oct | 3700530157623531 |
9 | 585810156078281 |
10 | 136385642047321 |
11 | 3a50290a407687 |
12 | 1336854b6a0961 |
13 | 5b14159735514 |
14 | 25971592da649 |
15 | 10b7a8468b931 |
hex | 7c0ac1bf2759 |
136385642047321 has 4 divisors (see below), whose sum is σ = 144408326873652. Its totient is φ = 128362957220992.
The previous prime is 136385642047309. The next prime is 136385642047351. The reversal of 136385642047321 is 123740246583631.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 56389361211225 + 79996280836096 = 7509285^2 + 8944064^2 .
It is a cyclic number.
It is not a de Polignac number, because 136385642047321 - 215 = 136385642014553 is a prime.
It is not an unprimeable number, because it can be changed into a prime (136385642047351) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4011342413140 + ... + 4011342413173.
It is an arithmetic number, because the mean of its divisors is an integer number (36102081718413).
Almost surely, 2136385642047321 is an apocalyptic number.
It is an amenable number.
136385642047321 is a deficient number, since it is larger than the sum of its proper divisors (8022684826331).
136385642047321 is an equidigital number, since it uses as much as digits as its factorization.
136385642047321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8022684826330.
The product of its (nonzero) digits is 17418240, while the sum is 55.
The spelling of 136385642047321 in words is "one hundred thirty-six trillion, three hundred eighty-five billion, six hundred forty-two million, forty-seven thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •