Base | Representation |
---|---|
bin | 10000010001000… |
… | …00100000011100 |
3 | 100111202021111200 |
4 | 20020200200130 |
5 | 234412314103 |
6 | 21312315500 |
7 | 3244534443 |
oct | 1010404034 |
9 | 314667450 |
10 | 136448028 |
11 | 70026472 |
12 | 39842b90 |
13 | 223656a2 |
14 | 1419bd5a |
15 | bea40a3 |
hex | 822081c |
136448028 has 36 divisors (see below), whose sum is σ = 347555208. Its totient is φ = 45133920.
The previous prime is 136448017. The next prime is 136448051. The reversal of 136448028 is 820844631.
136448028 is a `hidden beast` number, since 1 + 3 + 644 + 8 + 0 + 2 + 8 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 136447983 and 136448001.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 9751 + ... + 19182.
Almost surely, 2136448028 is an apocalyptic number.
136448028 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
136448028 is an abundant number, since it is smaller than the sum of its proper divisors (211107180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136448028 is a wasteful number, since it uses less digits than its factorization.
136448028 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29074 (or 29069 counting only the distinct ones).
The product of its (nonzero) digits is 36864, while the sum is 36.
The square root of 136448028 is about 11681.0970375218. The cubic root of 136448028 is about 514.8204080491.
The spelling of 136448028 in words is "one hundred thirty-six million, four hundred forty-eight thousand, twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •