Base | Representation |
---|---|
bin | 111110111011110011… |
… | …0101011000001111000 |
3 | 110220211212201110211110 |
4 | 1331313212223001320 |
5 | 4203242024100400 |
6 | 142030510400320 |
7 | 12523105152423 |
oct | 1756746530170 |
9 | 426755643743 |
10 | 135150612600 |
11 | 52353aa7663 |
12 | 222398000a0 |
13 | c98acb80b3 |
14 | 67815749ba |
15 | 37b011ae50 |
hex | 1f779ab078 |
135150612600 has 96 divisors (see below), whose sum is σ = 420109182720. Its totient is φ = 35941902720.
The previous prime is 135150612557. The next prime is 135150612613. The reversal of 135150612600 is 6216051531.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 86682 + ... + 527081.
It is an arithmetic number, because the mean of its divisors is an integer number (4376137320).
Almost surely, 2135150612600 is an apocalyptic number.
135150612600 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 135150612600, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (210054591360).
135150612600 is an abundant number, since it is smaller than the sum of its proper divisors (284958570120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
135150612600 is a wasteful number, since it uses less digits than its factorization.
135150612600 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 614149 (or 614140 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 30.
The spelling of 135150612600 in words is "one hundred thirty-five billion, one hundred fifty million, six hundred twelve thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •