Base | Representation |
---|---|
bin | 11110001111101101110101… |
… | …101011011001101100101100 |
3 | 122102222201111112021012011002 |
4 | 132033231311223121230230 |
5 | 114413410320021424030 |
6 | 1150525105051415432 |
7 | 40006323312522425 |
oct | 3617556553315454 |
9 | 572881445235132 |
10 | 133021406436140 |
11 | 39426075088242 |
12 | 12b04533a54578 |
13 | 592bb31c82b41 |
14 | 24bc3b008664c |
15 | 105a2d3270245 |
hex | 78fb75ad9b2c |
133021406436140 has 48 divisors (see below), whose sum is σ = 279630643612320. Its totient is φ = 53154149744640.
The previous prime is 133021406436103. The next prime is 133021406436197. The reversal of 133021406436140 is 41634604120331.
It is a junction number, because it is equal to n+sod(n) for n = 133021406436094 and 133021406436103.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 547713374 + ... + 547956186.
It is an arithmetic number, because the mean of its divisors is an integer number (5825638408590).
Almost surely, 2133021406436140 is an apocalyptic number.
133021406436140 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
133021406436140 is an abundant number, since it is smaller than the sum of its proper divisors (146609237176180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
133021406436140 is a wasteful number, since it uses less digits than its factorization.
133021406436140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 270722 (or 270720 counting only the distinct ones).
The product of its (nonzero) digits is 124416, while the sum is 38.
The spelling of 133021406436140 in words is "one hundred thirty-three trillion, twenty-one billion, four hundred six million, four hundred thirty-six thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •