Base | Representation |
---|---|
bin | 11111000000101011000010… |
… | …000011101101000110010011 |
3 | 122212220100012020220220002012 |
4 | 133000223002003231012103 |
5 | 120334020301200040433 |
6 | 1202022411300213135 |
7 | 40504352324002652 |
oct | 3700530203550623 |
9 | 585810166826065 |
10 | 136385647268243 |
11 | 3a50291235319a |
12 | 1336855139a1ab |
13 | 5b1415a842a19 |
14 | 2597159c99199 |
15 | 10b7a84d6d848 |
hex | 7c0ac20ed193 |
136385647268243 has 8 divisors (see below), whose sum is σ = 141598971474816. Its totient is φ = 131223184761600.
The previous prime is 136385647268207. The next prime is 136385647268279. The reversal of 136385647268243 is 342862746583631.
It is an interprime number because it is at equal distance from previous prime (136385647268207) and next prime (136385647268279).
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 136385647268243 - 26 = 136385647268179 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (136385643268243) 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, 12715419518 + ... + 12715430243.
It is an arithmetic number, because the mean of its divisors is an integer number (17699871434352).
Almost surely, 2136385647268243 is an apocalyptic number.
136385647268243 is a deficient number, since it is larger than the sum of its proper divisors (5213324206573).
136385647268243 is a wasteful number, since it uses less digits than its factorization.
136385647268243 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25430849965.
The product of its digits is 836075520, while the sum is 68.
The spelling of 136385647268243 in words is "one hundred thirty-six trillion, three hundred eighty-five billion, six hundred forty-seven million, two hundred sixty-eight thousand, two hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •