Base | Representation |
---|---|
bin | 11110011001000110101010… |
… | …000100001101111110011000 |
3 | 122112021101200022220201120222 |
4 | 132121012222010031332120 |
5 | 120004443023243420402 |
6 | 1152141320102135212 |
7 | 40104042142262213 |
oct | 3631065204157630 |
9 | 575241608821528 |
10 | 133666530451352 |
11 | 39654725840298 |
12 | 12ba9576721508 |
13 | 5977913422b62 |
14 | 25016cd23c77a |
15 | 106be8e8767a2 |
hex | 7991aa10df98 |
133666530451352 has 16 divisors (see below), whose sum is σ = 250624915041600. Its totient is φ = 66833219773600.
The previous prime is 133666530451313. The next prime is 133666530451361. The reversal of 133666530451352 is 253154035666331.
It is a junction number, because it is equal to n+sod(n) for n = 133666530451294 and 133666530451303.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9069977 + ... + 18697527.
It is an arithmetic number, because the mean of its divisors is an integer number (15664057190100).
Almost surely, 2133666530451352 is an apocalyptic number.
It is an amenable number.
133666530451352 is a deficient number, since it is larger than the sum of its proper divisors (116958384590248).
133666530451352 is a wasteful number, since it uses less digits than its factorization.
133666530451352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11363026 (or 11363022 counting only the distinct ones).
The product of its (nonzero) digits is 17496000, while the sum is 53.
The spelling of 133666530451352 in words is "one hundred thirty-three trillion, six hundred sixty-six billion, five hundred thirty million, four hundred fifty-one thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •