Base | Representation |
---|---|
bin | 10000010000011… |
… | …01010111110000 |
3 | 100111121021222201 |
4 | 20020031113300 |
5 | 234402312043 |
6 | 21310512544 |
7 | 3244060102 |
oct | 1010152760 |
9 | 314537881 |
10 | 136369648 |
11 | 6aa82598 |
12 | 39805754 |
13 | 22338acc |
14 | 1417b572 |
15 | be8ac4d |
hex | 820d5f0 |
136369648 has 40 divisors (see below), whose sum is σ = 284379120. Its totient is φ = 63114240.
The previous prime is 136369633. The next prime is 136369657. The reversal of 136369648 is 846963631.
It is a plaindrome in base 13.
It is a junction number, because it is equal to n+sod(n) for n = 136369598 and 136369607.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12483 + ... + 20701.
It is an arithmetic number, because the mean of its divisors is an integer number (7109478).
Almost surely, 2136369648 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 136369648, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (142189560).
136369648 is an abundant number, since it is smaller than the sum of its proper divisors (148009472).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136369648 is a wasteful number, since it uses less digits than its factorization.
136369648 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8305 (or 8299 counting only the distinct ones).
The product of its digits is 559872, while the sum is 46.
The square root of 136369648 is about 11677.7415624769. The cubic root of 136369648 is about 514.7218128720.
The spelling of 136369648 in words is "one hundred thirty-six million, three hundred sixty-nine thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •