Base | Representation |
---|---|
bin | 11110111011001100101000… |
… | …110101101001111011000000 |
3 | 122211120101001221121211022020 |
4 | 132323030220311221323000 |
5 | 120311334240104011131 |
6 | 1201133510142441440 |
7 | 40435233040245450 |
oct | 3673145065517300 |
9 | 584511057554266 |
10 | 136009414516416 |
11 | 3a3782a5811161 |
12 | 13307651893280 |
13 | 5ab782c21a04c |
14 | 2582c68465d60 |
15 | 10acdb4cdc996 |
hex | 7bb328d69ec0 |
136009414516416 has 224 divisors, whose sum is σ = 418428155645952. Its totient is φ = 38184425533440.
The previous prime is 136009414516379. The next prime is 136009414516429. The reversal of 136009414516416 is 614615414900631.
It is a tau number, because it is divible by the number of its divisors (224).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 80906065 + ... + 82570031.
Almost surely, 2136009414516416 is an apocalyptic number.
136009414516416 is a gapful number since it is divisible by the number (16) 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 136009414516416, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (209214077822976).
136009414516416 is an abundant number, since it is smaller than the sum of its proper divisors (282418741129536).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136009414516416 is a wasteful number, since it uses less digits than its factorization.
136009414516416 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1665047 (or 1665037 counting only the distinct ones).
The product of its (nonzero) digits is 1866240, while the sum is 51.
The spelling of 136009414516416 in words is "one hundred thirty-six trillion, nine billion, four hundred fourteen million, five hundred sixteen thousand, four hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •