Base | Representation |
---|---|
bin | 111111100010110110… |
… | …1100101000000000000 |
3 | 111001020012112101011221 |
4 | 1333011231211000000 |
5 | 4213433011431020 |
6 | 142404521444424 |
7 | 12600426515314 |
oct | 1770555450000 |
9 | 431205471157 |
10 | 136461045760 |
11 | 52966780476 |
12 | 22544640714 |
13 | cb39636b30 |
14 | 686760db44 |
15 | 383a1bc6aa |
hex | 1fc5b65000 |
136461045760 has 208 divisors, whose sum is σ = 357672792960. Its totient is φ = 49669079040.
The previous prime is 136461045751. The next prime is 136461045761. The reversal of 136461045760 is 67540164631.
It is a tau number, because it is divible by the number of its divisors (208).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (136461045761) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 18899431 + ... + 18906649.
Almost surely, 2136461045760 is an apocalyptic number.
136461045760 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 136461045760, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (178836396480).
136461045760 is an abundant number, since it is smaller than the sum of its proper divisors (221211747200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136461045760 is an equidigital number, since it uses as much as digits as its factorization.
136461045760 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7332 (or 7310 counting only the distinct ones).
The product of its (nonzero) digits is 362880, while the sum is 43.
The spelling of 136461045760 in words is "one hundred thirty-six billion, four hundred sixty-one million, forty-five thousand, seven hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •