Base | Representation |
---|---|
bin | 11110111111000100000111… |
… | …000101011101010010110000 |
3 | 122212111202221112212021002220 |
4 | 132333010013011131102300 |
5 | 120330212434332043000 |
6 | 1201455533332441040 |
7 | 40463360625323061 |
oct | 3677040705352260 |
9 | 585452845767086 |
10 | 136275136206000 |
11 | 3a46aa627804a0 |
12 | 1334b04b479180 |
13 | 5b068c84b982c |
14 | 2591a74c80568 |
15 | 10b4c67e751a0 |
hex | 7bf10715d4b0 |
136275136206000 has 640 divisors, whose sum is σ = 500240460275712. Its totient is φ = 31593105280000.
The previous prime is 136275136205993. The next prime is 136275136206043. The reversal of 136275136206000 is 602631572631.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 10909859755 + ... + 10909872245.
Almost surely, 2136275136206000 is an apocalyptic number.
136275136206000 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 136275136206000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (250120230137856).
136275136206000 is an abundant number, since it is smaller than the sum of its proper divisors (363965324069712).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
136275136206000 is a wasteful number, since it uses less digits than its factorization.
136275136206000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 19738 (or 19722 counting only the distinct ones).
The product of its (nonzero) digits is 272160, while the sum is 42.
Adding to 136275136206000 its reverse (602631572631), we get a palindrome (136877767778631).
The spelling of 136275136206000 in words is "one hundred thirty-six trillion, two hundred seventy-five billion, one hundred thirty-six million, two hundred six thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.118 sec. • engine limits •