Base | Representation |
---|---|
bin | 11110110111001100100001… |
… | …000111110001001010100000 |
3 | 122210121002020012201121211110 |
4 | 132313030201013301022200 |
5 | 120242333031211440000 |
6 | 1200403305324143320 |
7 | 40406326100152644 |
oct | 3667144107611240 |
9 | 583532205647743 |
10 | 135734407140000 |
11 | 3a281703272979 |
12 | 132822a2397b40 |
13 | 5a97913241306 |
14 | 257381a70ac24 |
15 | 10a5b6b845850 |
hex | 7b73211f12a0 |
135734407140000 has 240 divisors, whose sum is σ = 445259742748128. Its totient is φ = 36193911936000.
The previous prime is 135734407139987. The next prime is 135734407140023. The reversal of 135734407140000 is 41704437531.
It is a tau number, because it is divible by the number of its divisors (240).
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 1393571302 + ... + 1393668698.
Almost surely, 2135734407140000 is an apocalyptic number.
135734407140000 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 135734407140000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (222629871374064).
135734407140000 is an abundant number, since it is smaller than the sum of its proper divisors (309525335608128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
135734407140000 is an equidigital number, since it uses as much as digits as its factorization.
135734407140000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 120657 (or 120634 counting only the distinct ones).
The product of its (nonzero) digits is 141120, while the sum is 39.
The spelling of 135734407140000 in words is "one hundred thirty-five trillion, seven hundred thirty-four billion, four hundred seven million, one hundred forty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •