Base | Representation |
---|---|
bin | 100001101010110110010111… |
… | …100101001000101100100000 |
3 | 201102022022200220102002101210 |
4 | 201222312113211020230200 |
5 | 123402121101410340002 |
6 | 1242535023423030120 |
7 | 43122302451565560 |
oct | 4152662745105440 |
9 | 642268626362353 |
10 | 148080130558752 |
11 | 43201481294257 |
12 | 14736b0813b340 |
13 | 6481b864bc562 |
14 | 287d18bbacda0 |
15 | 121bd8610e96c |
hex | 86ad97948b20 |
148080130558752 has 48 divisors (see below), whose sum is σ = 444240391678272. Its totient is φ = 42308608730880.
The previous prime is 148080130558739. The next prime is 148080130558771. The reversal of 148080130558752 is 257855031080841.
It is a tau number, because it is divible by the number of its divisors (48).
It is a junction number, because it is equal to n+sod(n) for n = 148080130558692 and 148080130558701.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 110178667899 + ... + 110178669242.
It is an arithmetic number, because the mean of its divisors is an integer number (9255008159964).
Almost surely, 2148080130558752 is an apocalyptic number.
148080130558752 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
148080130558752 is an abundant number, since it is smaller than the sum of its proper divisors (296160261119520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
148080130558752 is a wasteful number, since it uses less digits than its factorization.
148080130558752 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 220357337161 (or 220357337153 counting only the distinct ones).
The product of its (nonzero) digits is 10752000, while the sum is 57.
The spelling of 148080130558752 in words is "one hundred forty-eight trillion, eighty billion, one hundred thirty million, five hundred fifty-eight thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •