Base | Representation |
---|---|
bin | 100011000010111110010110… |
… | …001111101101110001101101 |
3 | 202012202020222200211201002212 |
4 | 203002332112033231301231 |
5 | 130200331023041203423 |
6 | 1303453034552300205 |
7 | 44315650032144122 |
oct | 4302762617556155 |
9 | 665666880751085 |
10 | 154136012053613 |
11 | 45126796539907 |
12 | 153547126a1665 |
13 | 6800c6ac65435 |
14 | 2a0c319490749 |
15 | 12c4670e67578 |
hex | 8c2f963edc6d |
154136012053613 has 8 divisors (see below), whose sum is σ = 157494222207000. Its totient is φ = 150794467956288.
The previous prime is 154136012053549. The next prime is 154136012053663. The reversal of 154136012053613 is 316350210631451.
It can be written as a sum of positive squares in 4 ways, for example, as 29132811940324 + 125003200113289 = 5397482^2 + 11180483^2 .
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 154136012053613 - 26 = 154136012053549 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (154136012053663) 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, 4166495318 + ... + 4166532311.
It is an arithmetic number, because the mean of its divisors is an integer number (19686777775875).
Almost surely, 2154136012053613 is an apocalyptic number.
It is an amenable number.
154136012053613 is a deficient number, since it is larger than the sum of its proper divisors (3358210153387).
154136012053613 is an equidigital number, since it uses as much as digits as its factorization.
154136012053613 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8333028031.
The product of its (nonzero) digits is 194400, while the sum is 41.
The spelling of 154136012053613 in words is "one hundred fifty-four trillion, one hundred thirty-six billion, twelve million, fifty-three thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •