Base | Representation |
---|---|
bin | 111111001010110111… |
… | …0100111010101110000 |
3 | 110222011002201101021011 |
4 | 1332111232213111300 |
5 | 4210310414323440 |
6 | 142153003040304 |
7 | 12541453032460 |
oct | 1762556472560 |
9 | 428132641234 |
10 | 135656011120 |
11 | 52593310a93 |
12 | 2235ab10094 |
13 | ca3b910486 |
14 | 67cc733ba0 |
15 | 37de69d9ea |
hex | 1f95ba7570 |
135656011120 has 320 divisors, whose sum is σ = 400114391040. Its totient is φ = 41676079104.
The previous prime is 135656011111. The next prime is 135656011157. The reversal of 135656011120 is 21110656531.
It is a happy number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 51016351 + ... + 51019009.
It is an arithmetic number, because the mean of its divisors is an integer number (1250357472).
Almost surely, 2135656011120 is an apocalyptic number.
135656011120 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 135656011120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (200057195520).
135656011120 is an abundant number, since it is smaller than the sum of its proper divisors (264458379920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
135656011120 is a wasteful number, since it uses less digits than its factorization.
135656011120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2952 (or 2946 counting only the distinct ones).
The product of its (nonzero) digits is 5400, while the sum is 31.
Adding to 135656011120 its reverse (21110656531), we get a palindrome (156766667651).
The spelling of 135656011120 in words is "one hundred thirty-five billion, six hundred fifty-six million, eleven thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •