Base | Representation |
---|---|
bin | 11110101101101000110001… |
… | …001101100101000110111010 |
3 | 122201021021202111200101120222 |
4 | 132231220301031211012322 |
5 | 120201102304024241100 |
6 | 1155141433554020042 |
7 | 40311013353026165 |
oct | 3655506115450672 |
9 | 581237674611528 |
10 | 135077547102650 |
11 | 3a04907a969779 |
12 | 13196b25277622 |
13 | 5a4a9b15344b9 |
14 | 254db06a10adc |
15 | 1093a24c64485 |
hex | 7ada313651ba |
135077547102650 has 96 divisors (see below), whose sum is σ = 277120891699200. Its totient is φ = 48756884299200.
The previous prime is 135077547102649. The next prime is 135077547102703. The reversal of 135077547102650 is 56201745770531.
It is a junction number, because it is equal to n+sod(n) for n = 135077547102592 and 135077547102601.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 7710986 + ... + 18155285.
It is an arithmetic number, because the mean of its divisors is an integer number (2886675955200).
Almost surely, 2135077547102650 is an apocalyptic number.
135077547102650 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
135077547102650 is an abundant number, since it is smaller than the sum of its proper divisors (142043344596550).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
135077547102650 is a wasteful number, since it uses less digits than its factorization.
135077547102650 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25866564 (or 25866559 counting only the distinct ones).
The product of its (nonzero) digits is 6174000, while the sum is 53.
The spelling of 135077547102650 in words is "one hundred thirty-five trillion, seventy-seven billion, five hundred forty-seven million, one hundred two thousand, six hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •