Base | Representation |
---|---|
bin | 111110001010110010… |
… | …1011010011101110001 |
3 | 110202121021022100211021 |
4 | 1330111211122131301 |
5 | 4141410031143231 |
6 | 141155403215441 |
7 | 12434256154156 |
oct | 1742545323561 |
9 | 422537270737 |
10 | 133506115441 |
11 | 5168a7a35a6 |
12 | 21a5ab17581 |
13 | c7883a285a |
14 | 6666dba22d |
15 | 3715a7c811 |
hex | 1f1595a771 |
133506115441 has 8 divisors (see below), whose sum is σ = 134606560680. Its totient is φ = 132407495808.
The previous prime is 133506115417. The next prime is 133506115451. The reversal of 133506115441 is 144511605331.
It can be written as a sum of positive squares in 4 ways, for example, as 9035453025 + 124470662416 = 95055^2 + 352804^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 133506115441 - 27 = 133506115313 is a prime.
It is a super-3 number, since 3×1335061154413 (a number of 34 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 133506115397 and 133506115406.
It is not an unprimeable number, because it can be changed into a prime (133506115451) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 309346 + ... + 602251.
It is an arithmetic number, because the mean of its divisors is an integer number (16825820085).
Almost surely, 2133506115441 is an apocalyptic number.
It is an amenable number.
133506115441 is a deficient number, since it is larger than the sum of its proper divisors (1100445239).
133506115441 is a wasteful number, since it uses less digits than its factorization.
133506115441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 912803.
The product of its (nonzero) digits is 21600, while the sum is 34.
The spelling of 133506115441 in words is "one hundred thirty-three billion, five hundred six million, one hundred fifteen thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •