Base | Representation |
---|---|
bin | 11110111011011110010110… |
… | …001000110111111100000000 |
3 | 122211122012011001002222212210 |
4 | 132323132112020313330000 |
5 | 120312142210100442123 |
6 | 1201150332554422120 |
7 | 40436505154343265 |
oct | 3673362610677400 |
9 | 584565131088783 |
10 | 136028428140288 |
11 | 3a3853724821a2 |
12 | 1330b279431940 |
13 | 5ab956c447968 |
14 | 2583b4d74926c |
15 | 10ad629168e93 |
hex | 7bb796237f00 |
136028428140288 has 432 divisors, whose sum is σ = 396557855756160. Its totient is φ = 41269036032000.
The previous prime is 136028428140221. The next prime is 136028428140289. The reversal of 136028428140288 is 882041824820631.
It is a Harshad number since it is a multiple of its sum of digits (57).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136028428140289) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 1645775763 + ... + 1645858413.
Almost surely, 2136028428140288 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 136028428140288, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (198278927878080).
136028428140288 is an abundant number, since it is smaller than the sum of its proper divisors (260529427615872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136028428140288 is an equidigital number, since it uses as much as digits as its factorization.
136028428140288 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 82836 (or 82779 counting only the distinct ones).
The product of its (nonzero) digits is 9437184, while the sum is 57.
The spelling of 136028428140288 in words is "one hundred thirty-six trillion, twenty-eight billion, four hundred twenty-eight million, one hundred forty thousand, two hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •