Base | Representation |
---|---|
bin | 111111010111011101… |
… | …0000110101001111000 |
3 | 111000020112121200002100 |
4 | 1332232322012221320 |
5 | 4212142041001433 |
6 | 142302533303400 |
7 | 12555102524514 |
oct | 1765672065170 |
9 | 430215550070 |
10 | 136078453368 |
11 | 5278a815110 |
12 | 22458494b60 |
13 | caa82ab9c0 |
14 | 682c89b144 |
15 | 38167e6b13 |
hex | 1faee86a78 |
136078453368 has 576 divisors, whose sum is σ = 474297314400. Its totient is φ = 34626355200.
The previous prime is 136078453361. The next prime is 136078453387. The reversal of 136078453368 is 863354870631.
136078453368 is a `hidden beast` number, since 1 + 3 + 60 + 78 + 453 + 3 + 68 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136078453361) by changing a digit.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 168205348 + ... + 168206156.
Almost surely, 2136078453368 is an apocalyptic number.
136078453368 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 136078453368, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (237148657200).
136078453368 is an abundant number, since it is smaller than the sum of its proper divisors (338218861032).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136078453368 is a wasteful number, since it uses less digits than its factorization.
136078453368 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 924 (or 886 counting only the distinct ones).
The product of its (nonzero) digits is 8709120, while the sum is 54.
The spelling of 136078453368 in words is "one hundred thirty-six billion, seventy-eight million, four hundred fifty-three thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •