Base | Representation |
---|---|
bin | 111111100111101111… |
… | …1000010001010010000 |
3 | 111001122122001101020210 |
4 | 1333033133002022100 |
5 | 4214302000131300 |
6 | 142433100004120 |
7 | 12604460245215 |
oct | 1771737021220 |
9 | 431578041223 |
10 | 136625005200 |
11 | 52a40287642 |
12 | 2258b530640 |
13 | cb645b2858 |
14 | 68812cdb0c |
15 | 38497a8050 |
hex | 1fcf7c2290 |
136625005200 has 240 divisors, whose sum is σ = 453745083456. Its totient is φ = 35115417600.
The previous prime is 136625005199. The next prime is 136625005207. The reversal of 136625005200 is 2500526631.
It is a tau number, because it is divible by the number of its divisors (240).
It is a Harshad number since it is a multiple of its sum of digits (30).
It is not an unprimeable number, because it can be changed into a prime (136625005207) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 4066872 + ... + 4100328.
Almost surely, 2136625005200 is an apocalyptic number.
136625005200 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 136625005200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (226872541728).
136625005200 is an abundant number, since it is smaller than the sum of its proper divisors (317120078256).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136625005200 is a wasteful number, since it uses less digits than its factorization.
136625005200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 33602 (or 33591 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 30.
The spelling of 136625005200 in words is "one hundred thirty-six billion, six hundred twenty-five million, five thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •