Base | Representation |
---|---|
bin | 11110010000001101010000… |
… | …111101010001010000011100 |
3 | 122110002221121011220222222222 |
4 | 132100031100331101100130 |
5 | 114414433421411222112 |
6 | 1150552405255324512 |
7 | 40011626441120561 |
oct | 3620152075212034 |
9 | 573087534828888 |
10 | 133055150101532 |
11 | 3943941054550a |
12 | 12b0ab90680738 |
13 | 593207bb19859 |
14 | 24bdc9179a868 |
15 | 105b10a888372 |
hex | 790350f5141c |
133055150101532 has 48 divisors (see below), whose sum is σ = 238819839955200. Its totient is φ = 64824922631040.
The previous prime is 133055150101529. The next prime is 133055150101541. The reversal of 133055150101532 is 235101051550331.
It is a junction number, because it is equal to n+sod(n) for n = 133055150101492 and 133055150101501.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3071497769 + ... + 3071541087.
It is an arithmetic number, because the mean of its divisors is an integer number (4975413332400).
Almost surely, 2133055150101532 is an apocalyptic number.
It is an amenable number.
133055150101532 is a deficient number, since it is larger than the sum of its proper divisors (105764689853668).
133055150101532 is a wasteful number, since it uses less digits than its factorization.
133055150101532 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 66026 (or 66024 counting only the distinct ones).
The product of its (nonzero) digits is 33750, while the sum is 35.
The spelling of 133055150101532 in words is "one hundred thirty-three trillion, fifty-five billion, one hundred fifty million, one hundred one thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •