Base | Representation |
---|---|
bin | 10000010010001… |
… | …10111100000000 |
3 | 100112001021102202 |
4 | 20021012330000 |
5 | 234432333230 |
6 | 21315532332 |
7 | 3246061406 |
oct | 1011067400 |
9 | 315037382 |
10 | 136605440 |
11 | 70123764 |
12 | 398ba0a8 |
13 | 223bc22a |
14 | 141dd476 |
15 | bed5a45 |
hex | 8246f00 |
136605440 has 144 divisors (see below), whose sum is σ = 355410720. Its totient is φ = 50135040.
The previous prime is 136605401. The next prime is 136605451. The reversal of 136605440 is 44506631.
It is a happy number.
It is a super-2 number, since 2×1366054402 = 37322092475187200, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 997052 + ... + 997188.
It is an arithmetic number, because the mean of its divisors is an integer number (2468130).
Almost surely, 2136605440 is an apocalyptic number.
136605440 is a gapful number since it is divisible by the number (10) 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 136605440, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (177705360).
136605440 is an abundant number, since it is smaller than the sum of its proper divisors (218805280).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136605440 is a wasteful number, since it uses less digits than its factorization.
136605440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 218 (or 204 counting only the distinct ones).
The product of its (nonzero) digits is 8640, while the sum is 29.
The square root of 136605440 is about 11687.8329899088. The cubic root of 136605440 is about 515.0183045620.
The spelling of 136605440 in words is "one hundred thirty-six million, six hundred five thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •