Base | Representation |
---|---|
bin | 10000001111100… |
… | …11111100000000 |
3 | 100111102000002100 |
4 | 20013303330000 |
5 | 234340443342 |
6 | 21304350400 |
7 | 3243144300 |
oct | 1007637400 |
9 | 314360070 |
10 | 136265472 |
11 | 6aa112a2 |
12 | 39775400 |
13 | 22300575 |
14 | 14151600 |
15 | be69e4c |
hex | 81f3f00 |
136265472 has 324 divisors, whose sum is σ = 490731696. Its totient is φ = 36126720.
The previous prime is 136265431. The next prime is 136265477. The reversal of 136265472 is 274562631.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136265477) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 1919197 + ... + 1919267.
It is an arithmetic number, because the mean of its divisors is an integer number (1514604).
Almost surely, 2136265472 is an apocalyptic number.
136265472 is a gapful number since it is divisible by the number (12) 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 136265472, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (245365848).
136265472 is an abundant number, since it is smaller than the sum of its proper divisors (354466224).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136265472 is a wasteful number, since it uses less digits than its factorization.
136265472 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 124 (or 100 counting only the distinct ones).
The product of its digits is 60480, while the sum is 36.
The square root of 136265472 is about 11673.2802587790. The cubic root of 136265472 is about 514.5907100926.
The spelling of 136265472 in words is "one hundred thirty-six million, two hundred sixty-five thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •